Answer-What is a 'Binary Search Tree' (BST) and what is its key property?

BST enables efficient search, insertion, and deletion in Olog n average time through binary search eliminating half the tree at each step. In-order traversal Left-Root-Right yields sorted data. Worst case On for skewed trees all nodes on one side. Balanced BSTs AVL tree, Red-Black tree guarantee Olog n worst case. They are used in database indexing, symbol tables, and implementing sorted containers C stdmap, Java TreeMap.

Question

What is a 'Binary Search Tree' (BS

T and what is its key property?

A A tree where every node has exactly two children and all levels are completely filled

B A binary tree where for each node, all values in the left subtree are less than the node's value, and all values in the right subtree are greater

C A binary tree structure used exclusively for storing sorted arrays where a sorted array can be accessed through inorder traversal of the binary tree

D A balanced tree that guarantees O(log n) operations in all cases

E A tree where the root always contains the maximum value and the subtrees also follow the same rule

Practice Next