CS 400 PROFESSIONAL CERTIFICATE
OUTLINE 2026 FUNDAMENTAL CONCEPTS
WITH RESOLUTIONS CORE OPERATIONAL
BLUEPRINT
◉ RBT root property. Answer: must be black
◉ RBT red property. Answer: Red nodes must have black children or
no children
◉ RBT black property. Answer: every path from root to null child
must have same number of black nodes(include root)
◉ RBT lookup. Answer: same as BST
◉ RBT insert. Answer: Same as BST but rebalancing
◉ RBT delete. Answer: Same as BST but detect and fix
◉ RBT red node inserted, which property violated
A. root property
B. black property
C. red property. Answer: Red property if parent is red
, ◉ Tri-node restructuring (RBT). Answer: parent sibling is null
◉ Recoloring (RBT). Answer: parent sibling is red
◉ Time complexity of print (BST). Answer: o(n)
◉ Time complexity of lookup (BST). Answer: Determined by height
O(log2n)
◉ Time complexity of insert (BST). Answer: o(log2n)
◉ Time complexity of delete (BST). Answer: o(log2n)
◉ Load factor. Answer: # of items / table size
◉ As load factor increases collisions. Answer: increase
◉ Best table size. Answer: prime or 2k+1
◉ Open Addressing. Answer: Each table element stores 1 item
If collision search for open address
◉ Linear Probing. Answer: Step size is 1.
OUTLINE 2026 FUNDAMENTAL CONCEPTS
WITH RESOLUTIONS CORE OPERATIONAL
BLUEPRINT
◉ RBT root property. Answer: must be black
◉ RBT red property. Answer: Red nodes must have black children or
no children
◉ RBT black property. Answer: every path from root to null child
must have same number of black nodes(include root)
◉ RBT lookup. Answer: same as BST
◉ RBT insert. Answer: Same as BST but rebalancing
◉ RBT delete. Answer: Same as BST but detect and fix
◉ RBT red node inserted, which property violated
A. root property
B. black property
C. red property. Answer: Red property if parent is red
, ◉ Tri-node restructuring (RBT). Answer: parent sibling is null
◉ Recoloring (RBT). Answer: parent sibling is red
◉ Time complexity of print (BST). Answer: o(n)
◉ Time complexity of lookup (BST). Answer: Determined by height
O(log2n)
◉ Time complexity of insert (BST). Answer: o(log2n)
◉ Time complexity of delete (BST). Answer: o(log2n)
◉ Load factor. Answer: # of items / table size
◉ As load factor increases collisions. Answer: increase
◉ Best table size. Answer: prime or 2k+1
◉ Open Addressing. Answer: Each table element stores 1 item
If collision search for open address
◉ Linear Probing. Answer: Step size is 1.