Data Structure I Mock Test 5

10%

Question 1 of 10

1. The size value of various nodes in a weight balanced tree are
leaf - zero
internal node - size of it's two children
is this true?

true

false

Question 1 of 10

Question 2 of 10

2. Cartesian trees are most suitable for?

self balancing a tree

finding nth element

minimum range query and lowest common ancestors

searching

Question 2 of 10

Question 3 of 10

3. Consider the following data. The pre order traversal of a binary tree is A, B, E, C, D. The in order traversal of the same binary tree is B, E, A, D, C. The level order sequence for the binary tree is _________

A, B, C, E, D

A, C, D, B, E

D, B, E, A, C

A, B, C, D, E

Question 3 of 10

Question 4 of 10

4. Associative arrays can be implemented using __________

A doubly linked list

B-tree

A single linked list

A self balancing binary search tree

Question 4 of 10

Question 5 of 10

5. Which of the following trees is similar to that of an AA-Tree?

B+ Tree

Splay Tree

AVL Tree

Red-Black Tree

Question 5 of 10

Question 6 of 10

6. Who is the inventor of AA-Tree?

Daniel Sleator

Jon Louis Bentley

Arne Anderson

Rudolf Bayer

Question 6 of 10

Question 7 of 10

7. The steps for finding post-order traversal are traverse the right subtree, traverse the left subtree or visit the current node.

False

True

Question 7 of 10

Question 8 of 10

8. Find the postorder traversal of the binary tree shown below.

W R S Q P V T U X

S W T Q X U V R P

P Q R S T U V W X

S T W U X V Q R P

Question 8 of 10

Question 9 of 10

9. What is a weight balanced tree?

A binary tree that stores the sizes of subtrees in nodes

A binary tree with an additional attribute of weight

A height balanced binary tree

A normal binary tree

Question 9 of 10

Question 10 of 10

10. Which of the following data structures can be efficiently implemented using height balanced binary search tree?

both sets and priority queue

heap

priority queue

sets

Question 10 of 10