| Slide Index | | | <- prev | next -> |

12. Binary Search Trees

1: BST1: Overview 2: Totally Ordered Trees 3: Binary Search Revisited 4: Binary Search Trees 5: Binary Search Tree Class - Composition 6: Binary Search Tree Class - Design Pattern 7: A Binary Search Tree Class API 8: Implementing Binary Search 9: BST API Simplified 10: Implementing Get: Successful Search 11: Implementing Get: Unsuccessful Search 12: Implementing Put 13: Recap: BST Lite 14: class BSTLite 15: BST API 2 16: BST API 3 17: BST Recursive Methods 18: Recursive Implementations 19: Recursive Implementations 2 20: Recursive Implementations 3 21: Recursive Implementations 4 22: Recursive Implementations 5 23: Dump Methods 24: BST Lite Review 25: BST Search Time 26: Next Steps
    Copyright notice: The source documents, rendered pages, and content in this course are proprietary and may not be copied without express written permission of the author. (C) 1999 - 2012 R.C. Lacher, Florida State University.

<- prev | next -> | Top of Page |