Time Left - 05:00 mins
ISRO Exam CS 2017 Topic-Wise Quiz PDS( Binary Search Tree)
Attempt now to get your rank among 487 students!
Question 1
Worst case time complexity for finding depth of a binary search tree is
Question 2
A complete binary tree with n non leaf nodes contains:
Question 3
Suppose the numbers 7, 5, 1, 8, 3, 6, 0, 9, 4, 2 are inserted in that order into an initially empty binary search tree. The binary search tree uses the usual ordering on natural numbers. What is the in order traversal sequence of the resultant tree?
Question 4
The number of rotations required to insert a sequence of elements 9,6,5,8,7,10 into an empty AVL tree is?
Question 5
How many distinct binary search trees can be created out of 4 distinct keys?
- 487 attempts
- 0 upvotes
- 8 comments
Apr 7GATE & PSU CS
