Chapter 8: Trees
Chapter 8: Trees
Movies in the Database
Searching the Database
Sorting the Movies
A Sorted List of Movies
Searching the Sorted Database
Recall the Dictionary Searching Process
Another Description
Sequential vs. Divide and Conquer
Big-O Notation
Back to the Movie Database
Binary Search Tree Definition
Binary Search Tree Visual Representation 1
Binary Search Tree Visual Representation 2
Implementing Binary Search Trees: Constructor
Implementing Binary Search Trees: Selectors
Empty Trees
Tree Construction Example
Leaves
Interior Nodes
Inserting Into Binary Search Trees
How insert Works
Inserting into a BST from a List
The Order of Nodes Matters
Determining If an Element Is In a BST
Tracing in?
Efficiency Issues with BSTs
Height of Binary Trees
Depth of Binary Tree Nodes
Properties of Binary Trees
Maximum Leaves
Maximum Nodes
Maximum and Minimum Height
Balanced Trees and Search Efficiency
Creating Balanced Trees from Sorted Lists
BST Traversals
Preorder Traversal
More About append
Efficiency of preorder
A More Efficient preorder
Inorder Traversal
Sorting Lists Using BSTs
Postorder Traversal
Traversal Application: Creating Balanced Trees from Unbalanced Trees
Traversal Application: Drawing Trees
Expression Trees
Expression Tree Definition
Implementing Expression Trees
Evaluating Expression Trees
Looking Up the Operator Procedure
Another Use of Expression Trees