UGC NET CS 2012 June-Paper2
April 14, 2024UGC NET CS 2012 June-Paper2
April 14, 2024UGC NET CS 2012 June-Paper2
| Question 8 |
A binary search tree is a binary tree :
| All items in the left subtree are less than root | |
| All items in the right subtree are greater than or equal to the root | |
| Each subtree is itself a binary search tree | |
| All of the above |
Question 8 Explanation:
Binary search tree properties:
1. All items in the left subtree are less than root
2. All items in the right subtree are greater than or equal to the root
3. Each subtree is itself a binary search tree
1. All items in the left subtree are less than root
2. All items in the right subtree are greater than or equal to the root
3. Each subtree is itself a binary search tree
Correct Answer: D
Question 8 Explanation:
Binary search tree properties:
1. All items in the left subtree are less than root
2. All items in the right subtree are greater than or equal to the root
3. Each subtree is itself a binary search tree
1. All items in the left subtree are less than root
2. All items in the right subtree are greater than or equal to the root
3. Each subtree is itself a binary search tree