Binary Search Trees
A binary tree becomes a powerful search tool if its members are sorted properly.
A binary search tree is a particular kind of binary tree in which the data item in each left child node precedes the item in its parent, and the data item in the right child node follows the item in its parent.
You can create a binary search tree using dynamically allocated nodes linked by pointers.