Answer-Which property defines a Binary Search Tree (BST)?

This is the fundamental property of a Binary Search Tree, enabling efficient searching, insertion, and deletion operations.

Question

Which property defines a Binary Search Tree (BS

A Each node has at most two children.

B The value of each node is greater than or equal to the values of its children.

C The left subtree of a node contains only values less than the node's value, and the right subtree contains only values greater than the node's value.

D All leaf nodes are at the same level.

E The tree is always a complete binary tree.

Practice Next

More IT Operating System Questions

Which layer is not in OSI but in TCP/IP
The LRU replacement algorithm will select the page that:
How do you correctly create a new Map object in JavaScript?
What is a "smart object" in IoT?
The Naive Pattern Searching algorithm has a worst-case time complexity of O(MN), where 'M' is the length of the pattern and 'N' is the length of the text. ...
Which of the following statements accurately describes the use of the SQL CREATE statement?
Which of the following statements is true regarding user-level threads compared to kernel-level threads?
What is the time complexity for performing enqueue and dequeue operations on a queue implemented using a linked list?
What is the time complexity of the KMP algorithm for searching a pattern of length 'M' in a text of length 'N'?
For a sparse matrix, which representation method is generally preferred to save memory and improve computational efficiency?

Which property defines a Binary Search Tree (BS

Solution