Time Left - 15:00 mins

GATE 2022: Data Structure and Programming Quiz-10

Attempt now to get your rank among 343 students!

Question 1

What are the worst case and average case  Search complexities of a binary search tree?

Question 2

If for a given Binary Search Tree (BST) the pre-order traversal is 41, 23, 11, 31, 62, 50, 73 . Then which of the following is its post-order traversal?

Question 3

Can a tree stored in an array using either one of inorder or post order or pre order traversals be again reformed?

Question 4

The following numbers are inserted into an empty binary search tree in the given order:

10, 1, 3, 5, 15, 12, 16

What is the height of the binary search tree ?

Question 5

The post order traversal of binary search tree is given by 2, 7, 6, 10, 9, 8, 15, 17, 20, 19, 16, 12. The height of the tree is ________.

Question 6

Consider the following AVL tree,

After successive deletion of node 15 and 26 Consider inorder successor for replacement if possible(in case only one child left to the node to be deleted then replace with it).

After completion of deletion, total number of rotation required to balance the tree ___. Assume for LL and RR rotation,1 rotation and for LR and RL rotation, 2 rotation.

  • 343 attempts
  • 0 upvotes
  • 2 comments
Jul 31GATE & PSU CS

Posted by:

Priya UpadhyayPriya UpadhyayMember since Sep 2020
Priya Upadhyay
Share this quiz   |