LATEST UPDATE
Root
node without parent (A)
Internal node
node with at least one child (A, B,
C, F)
Leaf (aka External node)
node without children
(E, I, J, K, G, H, D)
Ancestors of a node
parent, grandparent,
great-grandparent, etc.
Siblings of a node
Any node which shares a
parent
Depth of a node
number of ancestors
Height of a tree
maximum depth of any node
(3)
Descendant of a node
child, grandchild, great-
grandchild, etc.
Subtree
tree consisting of a node and its
descendants
Edge
a pair of nodes (u,v) such that 𝑢 is
a parent of 𝑣 ((C, H))
Path
A sequence of nodes such that any
two consecutives nodes form an
edge(𝐴, B, F, J)
A tree is ordered when there is a linear
ordering defined for the children of each
node
size
number of nodes in the tree
Level
All of the nodes of depth #
preorder traversal