In a binary search tree (BST), what is the property that ensures efficient search operations?

  • Complete binary tree
  • Height-balanced
  • Max-heap property
  • Sorted keys
The property that ensures efficient search operations in a binary search tree (BST) is the sorted keys property. This property ensures that for any given node, all keys in its left subtree are less than the node's key, and all keys in its right subtree are greater, facilitating efficient search operations like binary search.
Add your answer
Loading...

Leave a comment

Your email address will not be published. Required fields are marked *