Digital-Logic-Design
October 16, 2023Digital-Logic-Design
October 16, 2023Data-Structures
| Question 269 |
Consider the following binary search tree T given below:
Which node contains the fourth smallest element in T?
| Q | |
| V | |
| W | |
| X |
Question 269 Explanation:
In-order traversal of binary search tree gives the ascending order of the elements.
The in-order traversal of the above tree is UQXWPVZY
So the fourth smallest element is 4th element of the inorder which is W
The in-order traversal of the above tree is UQXWPVZY
So the fourth smallest element is 4th element of the inorder which is W
Correct Answer: C
Question 269 Explanation:
In-order traversal of binary search tree gives the ascending order of the elements.
The in-order traversal of the above tree is UQXWPVZY
So the fourth smallest element is 4th element of the inorder which is W
The in-order traversal of the above tree is UQXWPVZY
So the fourth smallest element is 4th element of the inorder which is W
Subscribe
Login
0 Comments