From charlesreid1

Important Facts

For any binary tree, number of internal nodes and number of external nodes are related as:

E = I + 1

Scaling Complexity

Tree implementations can be made very complicated, or very simple.


  • Interfaces, abstract classes, virtual methods
  • Positions abstracted from nodes, array/linked either (flexible)
  • Pre/post-method hooks
  • Trees vs. binary trees
  • Sorted vs. unsorted
  • Bifurcations of methods that are needed, utility and modification