Unit 6-Part 3

Question 1

When does an AVL tree balance itself?

Answer 1

During the addition or removal of a node

Question 2

How long does searching take for an AVL tree?

Answer 2

O(logn)

Question 3

How long does insertion take for an AVL tree?

Answer 3

O(logn)

Question 4

Which tree is more balanced? AVL or Red Black Trees?

Answer 4

AVL trees are more balanced
-but cause more rotations during insertions and deletions

Question 5

Which tree should be used when there frequent insertions and deletions?

Answer 5

Red-Black Trees

Question 6

Which tree should be used when insertions and deletions are less frequent and search is more frequent?

Answer 6

AVL trees