Binary Search Trees

Steven J. Zeil

Old Dominion University, Dept. of Computer Science

Table of Contents

1. Definition: Binary Search Trees
1.1. The Binary Search Tree ADT
2. Implementing Binary Search Trees
2.1. Searching a Binary Tree
2.2. Inserting into Binary Search Trees
2.3. Deletion
3. How Fast Are Binary Search Trees?
3.1. Balancing
3.2. Performance
3.3. Balanced Best Case
3.4. Balanced Worst-Case
3.5. Degenerate Best-Case
3.6. Degenerate Worst-Case
3.7. Average-Case
3.8. Can We Avoid the Worst Case?

A tree in which every parent has at most 2 children is a binary tree.

The most common use of binary trees is for ADTs that require frequent searches for arbitrary keys.

For this we use a special form of binary tree, the binary search tree.


In the Forum:

(no threads at this time)