| Search Trees | Graphs |
|---|---|
| Objective: Find a final state | Objective: Visit every vertex |
| Can have duplicate states | Do not have duplicate states |
| Do not have cycles | Can have cycles |
| Are created dynamically as they are searched | Are already created and statically resident in memory before searches are performed on them |
Search trees can be created in ways analogous to BFS and DFS.