Appendix - adamtew/CS2420-Exam2 GitHub Wiki

  • Greedy: A greedy algorithm is an algorithm that follows the problem solving heuristic of making the locally optimal choice at each stage with the hope of finding a global optimum.
  • Null Path Length: the null path length (npl) of a node is the smallest number of nodes between it and a null in the tree