What is a Binary Search Tree (BST)?
2023
What is a Binary Search Tree (BST)?
- A.
A tree in which each node has exactly two children
- B.
A binary tree in which for each node, value of all the nodes in left sub tree is lesser and value of all nodes in right subtree is greater
- C.
A tree in which every node has at most two children, and all children nodes are leaf nodes
- D.
None of the above
Attempted by 189 students.
Show answer & explanation
Correct answer: B
A Binary Search Tree (BST) is a tree in which each node follows the property that all nodes in its left subtree are less than the node, and all nodes in its right subtree are greater than the node.