contents phase ii analysis of phase ii the heapsort algorithm version analysis of heapsort version comparison to other sorting algorithms summary review questions programming problems balanced binary search trees goals binary search trees avl trees splay trees iterative splaying recursive splaying performance analysis summary review questions programming problems -trees goals relational databases -tree organization the advantages of -trees -tree implementation -tree insert -tree delete summary review questions programming problems heuristic search goals depth first search breadth first search hill climbing best first search asearch minimax revisited summary review questions programming problems this copy belongs to 'acha