In computer science, a tree is a widely used Abstract data type that represents a hierarchical tree structure with a set of connected Vertices. Each node in the tree can be connected to many children (depending on the type of tree), but must be connected to exactly one parent, except for the root node, which has no parent. These constraints mean there are no cycles or “loops” (no node can be its own ancestor), and also that each child can be treated like the root node of its own subtree, making recursion a useful technique for tree traversal.

(“Tree (Data Structure)” 2022)

Traversal

References

“Tree (Data Structure).” 2022. Wikipedia, April. https://en.wikipedia.org/w/index.php?title=Tree_(data_structure)&oldid=1084348103.