My Report (&Account)

Weight Balanced Tree Test


Correct Answer: 2 points | Wrong: -1 point
Grades: A* (100% score) | A (80%-99%) | B (60%-80%) | C (40%-60%) | D (0%-40%)

1. What is the worst case analysis of an AA-Tree?

2. Comparing the speed of execution of Red-Black trees and AA-trees, which one has the faster search time?

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

4. AA Trees are implemented using?

5. Of the following rules that are followed by an AA-tree, which of the following is incorrect?
1- Only right children can be red
2- Procedures are coded recursively
3- Instead of storing colors, the level of a node is stored
4- There should not be any left children

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

7. Which of the following is the correct definition for a horizontal link?

8. What should be the condition for the level of a left node?

9. What are the two different operations done in an AA-Tree?

10. In the given figure, find ‘?’.
B is initially the right child of X then rotated right side


 

Start practicing “1000 MCQs on Data Structure”, and once you are ready, you can take tests on all topics by attempting our “Data Structure Test Series”.

advertisement
advertisement
Manish Bhojasia - Founder & CTO at Sanfoundry
Manish Bhojasia, a technology veteran with 20+ years @ Cisco & Wipro, is Founder and CTO at Sanfoundry. He lives in Bangalore, and focuses on development of Linux Kernel, SAN Technologies, Advanced C, Data Structures & Alogrithms. Stay connected with him at LinkedIn.

Subscribe to his free Masterclasses at Youtube & discussions at Telegram SanfoundryClasses.