Tree Test Output project involves the implementation of a templated tree node and functions for traversing such nodes
computer science
Description
Tree Project
Overview
This tree project is intended to provide students with an understanding of how tree structures are built and
connected and the basic traversal algorithms associated with them. This project involves the implementation of
a templated tree node and functions for traversing such nodes.
Structure
Information is often non-linear: it cannot be easily placed “inline” because of more complex relationships that
exist between pieces of data. This kind of data is usually difficult to store in arrays, lists, or tables. For
example, a descendant family tree would be difficult to implement in a list fashion, because each parent may
have several children. This information is more easily stored in a tree. A tree is made up of a root node and its
descendants. Each node in the tree may have zero or more child nodes. A node with no children is called a leaf
node. The ply level of a node is its depth.
