Tree

Rooted Tree

Edges = Vertices - 1

Root

State-space Tree

Back-tracking

Branch-and-bound

Ancestors

Proper

Parent

Siblings

Leaf

Child

Depth

Height

Height = max depth

Ordered Tree

all the children of each
vertex are ordered

Binary Tree

no more than 2 Children

Left Child

Right Child

Binary search tree

Searching and Insertion

Recursion

Game of Nim

Search

Omega ( n log n)

Binary Tree Transversal

Subtrees of the same type

Divide-and-conquer

Inorder

Postorder

Preorder