Nielit Scientist-B CS 22-07-2017
October 9, 2023Binary-Trees
October 9, 2023Data-Structures
|
Question 31
|
A binary search tree contains the value 1, 2, 3, 4, 5, 6, 7, 8. The tree is traversed in pre-order and the values are printed out. Which of the following sequences is a valid output?
|
5 3 1 2 4 7 8 6
|
|
|
5 3 1 2 6 4 8 7
|
|
|
5 3 2 4 1 6 7 8
|
|
|
5 3 1 2 4 7 6 8
|
Question 31 Explanation:
Preorder traversal means (Root, left, right)
Option D:
Let draw binary search tree for the given sequence,
After traversing through this tree we will get same sequence.
Option D:
Let draw binary search tree for the given sequence,
After traversing through this tree we will get same sequence.
Correct Answer: D
Question 31 Explanation:
Preorder traversal means (Root, left, right)
Option D:
Let draw binary search tree for the given sequence,
After traversing through this tree we will get same sequence.
Option D:
Let draw binary search tree for the given sequence,
After traversing through this tree we will get same sequence.
Subscribe
Login
0 Comments