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.
Loading...
Related Quiz
- The ___________ header is used to specify the format of the response accepted by the client.
- NAT allows multiple devices within a local network to share a single ________ IP address.
- Dynamic programming is often used to solve problems related to ___________ optimization.
- In a large enterprise application, there's a need to integrate legacy code with modern systems. How could the Adapter design pattern be applied to facilitate this integration?
- What is the function of an inode in a Unix-like file system?