Binary Search Tree Questions asked in Previous Year Paper of Gate and UGC NET Exam as well University Exam. Friends all four questions of Binary Search Tree of Gate Exam are described below with the answer. Please follow the video for the solution of all the four question.
Binary Search Tree Previous Year Gate Question
1. Consider the following Binary Search Tree:
If We randomly search one of the keys present in given BST what would be the expected number of comparison ?
(A) 2.75
(B) 2.25
(C) 2.57
(D) 3.25
Answer : (B)
2. A Binary Search Tree is used to locate the Number 43. which of the following sequences are possible and which are not?
(A) 61,52,14,17,40.43
(B) 2,3,50,40,60,43
(C) 10,65,31,48,37,43
(D) 17,77,27,66,18,43
Answer : (B) & (E)
3. Which of the following traversals is sufficient to construct Binary Search Tree from Given Traversals .
1. Inorder
2. Preorder
3. Postorder
(A) Any One
(B) 2 or 3 is sufficient
(C) 1 and 3
(D) 2 and 3
Answer: (B)
4. The Preorder traversal sequence of a binary search tree is 30,20,10,15,25,23,39,35,42 what will be postorder traversal sequence for same tree?
(A) 10,20,15,23,25,35,42,39,30
(B) 15,10,25,23,20,42,35,39,30
(C) 15,20,10,23,25,42,35,39,30
(D) 15,10,23,25,20,35,42,39,30
Answer: (D)
Please follow the video for Solution of all four question :
Friends if you have also another solution for this Binary Search Tree Related Gate Question please let us through comment section and we will publish it through our Gate MCQ you tube channel
No comments:
Post a Comment