Lecture 7

Question 1

What are the runtimes of sorted arrays?

Answer 1

Question 2

What are the three pointers every node has in a binary search tree?

Answer 2

Question 3

What property do all keys follow in a Binary Search Tree?

Answer 3

Question 4

Are BST’s unique?

Answer 4

No, multiple BST can follow the BST key property

Question 5

How to do search in a BST?

Answer 5

Question 6

What is the pseudocode for search in BST?

Answer 6

Question 7

How to find min/max in a BST?

Answer 7

When looking for max change left into right

Question 8

What is the pseudocode for max/min in a BST? What is the runtime?

Answer 8

Question 9

How to do insert in a BST?

Answer 9

Question 10

What is the pseudocode of insert in a BST? What is the runtime?

Answer 10

Question 11

What are the ideas of the steps of deleting in a BST?

Answer 11

Question 12

What are the steps of removing an element of a BST which has one child?

Answer 12

Question 13

What are the steps of removing an element of a BST which has two children?

Answer 13

Question 14

What is the best case of Search, Insert and Deleting of a BST? When does this happen?

Answer 14

O(log₂(n)), when the BST is perfectly balanced

Question 15

What is the worst case of Search, Insert and Deleting of a BST? When does this happen?

Answer 15

Question 16

What is a Red-Black tree? What is its key idea?

Answer 16

Question 17

What properties does a RB tree follow?

Answer 17

Question 18

What is black-height?

Answer 18

Question 19

What is the height of a RB tree?

Answer 19

Question 20

What are the order of operations in a RB tree?

Answer 20

O(log₂(n))