What is a Binary Search Tree? How does it work?

Question

Accepted Answer

A Binary Search Tree is a data structure where each node has at most two children and the left child is smaller than the parent while the right child is greater.

Nodes are arranged in a hierarchical order.
Searching, insertion, and deletion can be done in O(log n) time complexity.
In-order traversal of a BST gives the nodes in sorted order.
Example: 5 is the root node, 3 is its left child, and 7 is its right child. 2 is the left child of 3 and 4 is the right child of 3.
Example: Searching for 4 in the above tree starts at the root node. Since 4 is less than 5, we move to the left child. Since 4 is greater than 3, we move to the right child of 3. Since 4 is equal to 4, we have found the node.

What is a Binary Search Tree? How does it work?

Top Talentica Software Associate Data Engineer interview questions & answers

Popular interview questions of Associate Data Engineer