Tree ADT
So far we have been introduced and used several sequential
structures as list, linked list, stacks, and queues.
These structures organize data in a linear fashion in which the
data elements have a "before" and "after" relationship.
They work well with many types of problems, but some problems
require data to be organized in a nonlinear fashion.
In this class, we explore the tree data structure, which can be
used to arrange data in a hierarchical order.
Trees can be used to solve many different problems, including
those encountered in data mining, database systems, encryption,
artificial intelligence, computer graphics, and operating
systems.