What is a binary search tree?
- A binary tree where each node has at most two children, and each node's left child is less than the node, and the right child is greater.
- A tree where each node has exactly two children, regardless of their values.
- A tree where each node's value is equal to its depth in the tree.
- A tree with only two nodes: root and leaf.
A binary search tree (BST) is a binary tree where each node has at most two children. The key property is that each node's left child must have a value less than the node, and the right child must have a value greater. This allows for efficient searching, insertion, and deletion of elements.
Loading...
Related Quiz
- What is the Travelling Salesman Problem?
- Which type of relationship is represented by a foreign key in a database?
- Your company's web application is experiencing performance issues due to database overload. How would you use caching to alleviate this bottleneck?
- Which HTTP request method should be used for idempotent operations that do not modify resources?
- Explain the difference between logging and monitoring in the context of software systems.