MA
240, Instructor: Jeffrey Horn
TREES
Rooted Trees
- Definitions:
- Be familiar with
these. I won't ask directly for definitions, but I will use
the terms in asking you about the rest of the tree topics!
(E.g., How many leaf nodes are there in full, balanced tree of depth d with branching factor k?)
- Node, leaf, internal node, branches, branching factor,
parent, child, sibling (node), level, depth, subtree, root node, full
tree, balanced tree, binary tree
- Counting Nodes:
- Number of nodes at level d in a full binary
tree.
- Number of nodes at level d in a full ternary
tree.
- Number of nodes at level d in a full k-ary
tree.
- How deep is a balanced tree (branching factor k) that holds n nodes (total, leaves plus internal nodes)?
- Tree Traversals:
- Depth-first
- Pre-order
- In-order
- Post-order
- Breadth-first
Non-rooted Trees
- Spanning Tree
- Minimum cost Spanning Tree
- Prim and Kruskal's greedy algorithms