 |
|
|
|||
|
|||||
 |
|||||
|
|
 |
|
|
|
New Final Questions: Given a BST, show what the tree would look like if a node was deleted Explain psuedocode for searching a BST Explain a Binary Search Explain a QuickSort and Radix Sort Given a set of inputs, Show what the heap would look like Show the tree after the top node is deleted Explain a Hash Search |
|
|