Question

What is the defining property of a Binary Search Tree (BS

  • T ?
A Each node has at most two children.
B The left child of a node is always greater than its parent, and the right child is always smaller.
C For any node, all values in its left subtree are less than the node's value, and all values in its right subtree are greater than the node's value.
D The tree is always perfectly balanced, ensuring O(log N) operations.
E It allows for O(1) search, insertion, and deletion in all cases.
Practice Next

Hey! Ask a query