MA 240,  Instructor:  Jeffrey Horn

TREES

Rooted Trees

• Definitions:
  1. Node, leaf, internal node, branches, branching factor, parent, child, sibling (node), level, depth, subtree, root node, full tree, balanced tree, binary tree
• Counting Nodes:
  1. Number of nodes at level d in a full binary tree. 
  2. Number of nodes at level d in a full ternary tree. 
  3. Number of nodes at level d in a full k-ary tree. 
• Tree Traversals:
  1. Depth-first
     1. Pre-order
     2. In-order
     3. Post-order
  2. Breadth-first

Non-rooted Trees

• Spanning Tree
  1. Minimum cost Spanning Tree
  2. Prim and Kruskal's greedy algorithms