How will you remove a left horizontal link in an AA-tree?

• by performing right rotation
• by performing left rotation
• by deleting both the elements
• by inserting a new element

In an AA-tree, we process split first, followed by a skew.

• True
• False

How many different shapes does maintenance of AA-Tree need to consider?

• 7
• 5
• 2
• 3

Who is the inventor of AA-Tree?

• Arne Anderson
• Daniel Sleator
• Rudolf Bayer
• Jon Louis Bentley

What is the prime condition of AA-tree which makes it simpler than a red-black tree?

• Only right children can be red
• Only left children can be red
• Right children should strictly be black
• There should be no left children

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

• Splay Tree
• B+ Tree
• AVL Tree
• Red-Black Tree

Associative arrays can be implemented using __________

• B-tree
• A doubly linked list
• A single linked list
• A self balancing binary search tree

The minimum height of self balancing binary search tree with n nodes is

• log2(n)
• n
• 2n + 1
• 2n – 1

Which of the following is not the self balancing binary search tree?

• AVL Tree
• 2-3-4 Tree
• Red – Black Tree
• Splay Tree

The binary tree sort implemented using a self – balancing binary search tree takes ______ time is worst case.

• O(n log n)
• O(n)
• O(n2)
• O(log n)