Slides for Rosen, 5th edition - Computer Science - WPI精品.pptVIP

* (c)2001-2003, Michael P. Frank * §9.2: Applications of Trees Binary search trees A simple data structure for sorted lists Decision trees Minimum comparisons in sorting algorithms Prefix codes Huffman coding Game trees * (c)2001-2003, Michael P. Frank * Binary Search Trees A representation for sorted sets of items. Supports the following operations in Θ(log n) average-case time: Searching for an existing item. Inserting a new item, if not already present. Supports printing out all items in Θ(n) time. Note that inserting into a plain sequence ai would instead take Θ(n) worst-case time. * (c)20