CMSC-341, Spring 1999, Sections 101 and 201
Lecture Synopsis
7. Binary Search Trees
[Previous Lecture]
[Next Lecture]
- Definitions
- Tree
- Rooted tree
- Parent, Child
- Siblings
- Depth
- Height
- Levels
- Leaf
- Sub-tree
- Binary tree
- Full binary tree
- Perfect binary tree
- Complete binary tree
- Traversal orders
- Preorder
- Inorder
- Postorder
- Binary Search Tree Property
[Previous Lecture]
[Next Lecture]
Last modified on
Monday March 15, 1999 (13:42:36 EST)
by
Alan Baumgarten
email: abaumg1@cs.umbc.edu
Back up
to Spring 1999 CMSC-341 Section 1 and 2 Homepage