GNU libavl 2.0.1
Author: Ben Pfaff

3 Search Algorithms |

In libavl, we are primarily concerned with binary search trees and balanced binary trees. If you're already familiar with these concepts, then you can move right into the code, starting from the next chapter. But if you're not, then a little motivation and an explanation of exactly what a binary search tree is can't hurt. That's the goal of this chapter.

More particularly, this chapter concerns itself with algorithms for searching. Searching is one of the core problems in organizing a table. As it will turn out, arranging a table for fast searching also facilitates some other table features.

Sections:

- 3.1 Sequential Search
- 3.2 Sequential Search with Sentinel
- 3.3 Sequential Search of Ordered Array
- 3.4 Sequential Search of Ordered Array with Sentinel
- 3.5 Binary Search of Ordered Array
- 3.6 Binary Search Tree in Array
- 3.7 Dynamic Lists

2.12 Additional Exercises | Table of Contents | 3.1 Sequential Search