CSE 2353

1
CSE 2353 October 28th 2002

• Graph Theory

2
Isomorphism

• Isomorphic trees on 4 vertices

3
Traversals

• Pre-Order
• Post-Order
• In-Order

4
Euler Tour Algorithm
5
Heaps

• Binary Tree
• Compact
• Parent less/greater than children

6
Heap Insert
7
Heap Delete
8
Heap Storage

• Pointers
• Array as tree
• Array as heap

9
MSTs

• Definition

10
Prims Algorithm
11
Kruskals Algorithm