Time Left - 05:00 mins
NIELIT Scientist –B Daily Quiz - 3 (PDS)
Attempt now to get your rank among 530 students!
Question 1
A binary search tree B, has a particular node with two children. Now if this node is deleted then what replaces this node?
Question 2
The height of a tree is the length of the longest root to leaf path in it. The maximum and minimum number of nodes in a binary tree of height 4 is.
Question 3
Question 4
Let T be a binary search tree with n nodes and sa the average number of comparisons required for a successful search and uabe the average number of comparisons required for an unsuccessful search. Then which of the following relation holds true?
Question 5
What is the maximum number of Binary Search Trees possible with 6 nodes?
- 530 attempts
- 0 upvotes
- 12 comments
Tags :
GATE & PSU CSGeneralApr 2GATE & PSU CS
