Binary Tree: A recursive structure
- Recognize the recursive nature of the tree structure.
A binary tree is a recursive structure. You can imagine there is a left and a right subtree to the sides of the root, each with their own root and left/right subtrees, each with their own root and
In a tree , a node together with all of its descendants, if any, is called a subtree of . Node is the root of its subtree.
The recursive structure of the tree lends itself to a recursive implementation of operations on it.
Resources
- Definition on Dictionary of Algorithms and Data Structures: recursive data structure.