Question 11473 – APPSC-2012-DL CA
March 24, 2024Databases
March 24, 2024Question 11475 – APPSC-2012-DL CA
Which one from the following is a true statement about Binary trees (BST)?
Correct Answer: D
Question 5 Explanation:
1. In Binary search tree the right child of a node is greater than or equal to given node and left child of a node is less than the given node. So true.
2. True.
3. True, in this case the tree will be skewed.
2. True.
3. True, in this case the tree will be skewed.
A BST is the Binary tree in which data in the nodes is ordered in a particular way.
The data in any nodes of right subtree of BST must be greater than or equal to the data in the given node.
A BST have worst case when the data is already in order.
All (1), (2) and (3).