Time Left - 15:00 mins
GATE 2024 Programming & Data Structures Rank Booster Quiz 29
Attempt now to get your rank among 114 students!
Question 1
Consider a Binary Tree:
Which of the following is valid Converse Pre-order?
Question 2
Generate Lexically ordered binary tree for nodes:
PACE, Ram, Raj, Keshav, Babu, Baby. What is in-order?
PACE, Ram, Raj, Keshav, Babu, Baby. What is in-order?
Question 3
Parenthesis is allowed in :
Question 4
Create AVL tree
The height of the generated tree is _______ (root is @ level 1)
Question 5
Which of the following is false?
Question 6
Given post order and in order.
Post-order: d e c g h f b k j i a
In-order: d c e b g f h a j k i
The depth of the tree is_____. (Note: root is at level 0)
Question 7
Consider T be a AVL search tree with 20 nodes. The minimum and maximum possible height of T are
[Note: The height of tree with a single node is 0]
[Note: The height of tree with a single node is 0]
- 114 attempts
- 1 upvote
- 0 comments
Dec 14GATE & PSU CS