Rooted Tree
Jump to navigation
Jump to search
A Rooted Tree is a graph tree with a tree node that is labeled as a root node.
- Context:
- It can range from being a Directed Rooted Tree to being a Undirected Rooted Tree.
- It can range from being an Unbalanced Tree to being a Balanced Tree (where there is no more than one layer difference - to account for growth).
- Example(s):
- a Decision Tree.
- …
- Counter-Example(s):
- an Unrooted Tree.
- See: Directed Graph.