Advanced Data Structures (1)
Advanced Data Structures (1)
UNIT-III
5. What is an AVL tree? Write the properties of an AVL tree. Explain different rotations that are
applied during insertion operation on an AVL tree with examples. (14M)
(OR)
Page 1 of 2
6. What is a splay tree? Explain various rotations applied on a splay tree during an insertion
operation with examples. (14M)
UNIT-IV
7. Define a B-Tree of order m. Start with an empty B-Tree of order 4 and insert the following
keys: 21, 11, 51, 61, 71, 41, 31, 81, 91, 101 and 111. Draw the B-Tree of order 4 after each
insertion. (14M)
(OR)
8. Define an m-way search tree. Describe the properties of m-way search trees. Give example for
7-way search trees. Show how insertion, deletion and search operations can be done on this 7-
way search tree. (14M)
UNIT-V
9. Write about Digital Search Tree. Start with an empty Digital Search Tree and insert the given
elements in the given order and draw Digital Search Tree for every insertion:
0011, 1011, 1100, 0100, 0110, 0001, 1010, 0101.
From the tree constructed, delete the keys: 0100, 0110, 0101 (14M)
(OR)
10. a) With a suitable example describe the procedure for insertion of a node into a Binary Trie.
(7M)
b) Discuss about Multi-way Tries with an example. (7M)
*****
Page 2 of 2