Test prep Flashcards
1
Q
Rotations on redblack tree left right
A
2
Q
Rotations on a red black tree right left
A
3
Q
Time complexity best case
A
4
Q
Time complexity worst case
A
5
Q
Max heap
A
6
Q
Min heap
A
7
Q
identify the data structure
A
8
Q
Colour of root node in a red black tree
A
9
Q
What is the extra piece of storage on a red black tree node compared to a binary search tree node?
A
the node also holds a colour
10
Q
What it a binary search tree node and a red black tree node made up of ?
A
11
Q
What are the 6 rules of a red black tree?
A
- every node is either red or black
- the root is always black
- new insertions are always red
4.Every path can have 2 consecutive red nodes - Nulls are black nodes
12
Q
How do you work out the path of a black node
A
13
Q
What is a sentinel binary tree
A
A special Node object used to indicate an absent child or parent node
14
Q
What is the p in a binary search tree node
A
15
Q
How do you work out the height of a binary tree
A
