CIT 594 FINAL EXAM 2025
ANSWER ALL QUESTIONS IN THIS SECTION
QUESTION 1
What is an AVL tree and why is it named AVL? - ANSWERS--Its named AVL
after its inventors Adelson-Velsky and Landis
-It is a self balancing binary search tree
QUESTION 2
What is the time complexity for all self balancing BSTs? - ANSWERS-O(log₂n )
QUESTION 3
What are the four rules of a red black tree? - ANSWERS-1) Each node is colored
red or black
2) all null nodes are colored black
3) every red node has two black child nodes
4) Every path from any node to any null node must have the same number of black
nodes. This is known as the "black-height" of the tree
QUESTION 4
END OF
PAGE 1
ANSWER ALL QUESTIONS IN THIS SECTION
QUESTION 1
What is an AVL tree and why is it named AVL? - ANSWERS--Its named AVL
after its inventors Adelson-Velsky and Landis
-It is a self balancing binary search tree
QUESTION 2
What is the time complexity for all self balancing BSTs? - ANSWERS-O(log₂n )
QUESTION 3
What are the four rules of a red black tree? - ANSWERS-1) Each node is colored
red or black
2) all null nodes are colored black
3) every red node has two black child nodes
4) Every path from any node to any null node must have the same number of black
nodes. This is known as the "black-height" of the tree
QUESTION 4
END OF
PAGE 1