Go backward to Binary Trees Go up to Top

Summary

• Directed graphs
  • Pair of node set and edge relation.
  • Adjacency matrix.
  • Degree.
• Paths and reachability
  • Closure of relations.
  • Reachability is closure of edge relation.
• Trees
  • Root, parent, children.
  • Levels and heights.