GATE CSE: Data structures

Question 1 of 10

A complete binary tree has 1000 nodes. How many of them are leaves?

Question 2 of 10

What is the postfix form of A + B * C - D?

Question 3 of 10

The minimum number of nodes in an AVL tree of height 3 (a single node has height 0) is:

Question 4 of 10

Keys 12, 22, 32 are inserted in that order into a table of size 10 with h(k) = k mod 10 and linear probing. Where does 32 end up?

Question 5 of 10

Which traversal of a binary search tree lists its keys in sorted order?

Question 6 of 10

A heap is stored in an array starting at index 1. The children of the node at index i are at:

Question 7 of 10

Building a binary heap from n unsorted elements with bottom-up heapify takes:

Question 8 of 10

How many structurally different binary search trees can hold 3 distinct keys?

Question 9 of 10

Push 1, 2, 3; pop; push 4; pop; pop. In what order were elements popped?

Question 10 of 10

The worst-case time to search a hash table with chaining that holds n keys in m slots is: