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. What is the worst case time Complexity for search, insert and delete operation in a general Binary Search Tree?
(A) O(n) for all
(B) O(log n) for all
(C) O(Log n) for search and insert and O(n) for delete.
(D) O( Log n) for search and O(n) for insert, delete
Answer : (A)
2. We are given a set of n distinct element and an unblabeled binary tree with n nodes. In how may ways can we populate the tree with given set so that it becomes a binary search tree ( Gate 2011)
(A) 0
(B) 1
(C) n!
(D) (1/(n+1).2n Cn)
Answer : (B)
3. A Binary Search Tree is generated by inserting in order of the following keys.
50,15,62,5,20,58,91,3,8,37,60,24
The number of node in the left subtree and right subtree of the root respectively ? (Gate 1996)
(A) (4,7)
(B) (8,3)
(C) (7,4)
(D) (3,8)
Answer: (C)
4. How many distinct binary search trees can be created out of 4 distinct keys ? ( Gate 2005)
(A) 5
(B) 14
(C) 24
(D) 35
Answer: (B)
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