Page tree

Versions Compared

Key

  • This line was added.
  • This line was removed.
  • Formatting was changed.

...

Nodes that have degree one are called leaf nodes (C,G,E,H,I above). The other nodes are called internal (or interior) node nodes (A,B,D,F above).

A directed tree is bifurcating if the outdegree of each node is either zero or two. An undirected tree is bifurcating if all nodes have degree either three or one. Nodes whose degree exceeds the said limit (for directed trees two and for undirected trees three) are called multifurcating, an example being node B above with outdegree three and degree four.

...