Definitions For Rooted Trees
- A directed edge refers to the link from the parent to the child (the arrows in the picture of the tree).
- The root node of a tree is the node with no parents. There is at most one root node in a rooted tree.
- A leaf node has no children.
- The depth of a node n is the length of the path from the root to the node. The set of all nodes at a given depth is sometimes called a level of the tree. The root node is at depth zero.
- The depth (or height) of a tree is the length of the path from the root to the deepest node in the tree. A (rooted) tree with only one node (the root) has a depth of zero.
- Siblings are nodes that share the same parent node.
- A node p is an ancestor of a node q if it exists on the path from the root to node q. The node q is then termed as a descendant of p.
- The size of a node is the number of descendants it has including itself.
- In-degree of a node is the number of edges arriving at that node.
- Out-degree of a node is the number of edges leaving that node.
- The root is the only node in the tree with In-degree = 0.
- All the leaf nodes have Out-degree = 0.
Read more about this topic: Binary Tree
Famous quotes containing the words definitions, rooted and/or trees:
“Lord Byron is an exceedingly interesting person, and as such is it not to be regretted that he is a slave to the vilest and most vulgar prejudices, and as mad as the winds?
There have been many definitions of beauty in art. What is it? Beauty is what the untrained eyes consider abominable.”
—Edmond De Goncourt (1822–1896)
“Macbeth. Canst thou not minister to a mind diseased,
Pluck from the memory a rooted sorrow,
Raze out the written troubles of the brain,
And with some sweet oblivious antidote
Cleanse the stuffed bosom of that perilous stuff
Which weighs upon the heart?
Doctor. Therein the patient
Must minister to himself.”
—William Shakespeare (1564–1616)
“The trees may wish for quiet, but the wind will not subside.”
—Chinese proverb.