COMP 210 Final.helper

What is the average time complexity of Search, Insertion, and Deletion for AVL Trees

Average time complexity for B Trees

What is bubble sort time complexity

Best and Average case of Quick Sort Time Complexity

Worst Case Time complexity of Quick Sort

You need to do frequent insert, delete, and search operations and you need only good performance on average.

• Hashing Table with automatic resizing

• Balanced BST

• Heaps

You need to do frequent insert, delete, and search operations but the worst-case performance is important

• Balanced BST

• Heaps

• Hashing Table with automatic resizing

You need to frequently insert new integers and then dequeue the minimum integer.

• Heaps

• Balanced BST

• Hashing Table with automatic resizing

After inserting a new node into a Red-Black Tree, it is possible that the tree needs to be rebalanced to maintain its properties.

• True

• False

These are Red-Black Tree Properties:

Root of tree is black as well as null
Red nodes have two black children
Red node have to have a black parent

All paths from a node to it's descendants leaves must have the same number of black nodes

• True

• False