EagleView Data Scientist Interview Questions and Answers

To find the middle of a linked list in one iteration, use two pointers with different speeds.

• Initialize two pointers, one slow and one fast, both pointing to the head of the linked list.

• Move the slow pointer one step at a time and the fast pointer two steps at a time.

• When the fast pointer reaches the end of the linked list, the slow pointer will be at the middle node.

A binary tree is a data structure consisting of nodes, where each node has at most two children.

• Binary tree is used to represent hierarchical relationships between nodes

• Traversal of binary tree can be done in three ways: inorder, preorder, postorder

• Binary search tree is a type of binary tree where left child is smaller and right child is greater than parent

• Balanced binary tree has height difference of at most 1 between...read more