Depth first (uses stack - last in, first out)
Start at root, follow one branch as far as it goes until the end of branch then
backtrack
Breath-first (uses queue)
Start at root, scan every node connected and then scan left to right
The path you take doesn't matter as long as you start at the root for both
depth and breath
1)Example of Depth first using stack
A---B stack stack stack
| | -- -- --
| | -- (-->) -- (-->) E (-->) we reached the end of the node E which isnt
connected to anything else
C E -- B B so we back track and take pop out the top letters
untill we find another route
A A A
Stack stack
-- --
-- (-->) -- (-->) we found a new route/node connected to A so we stack again
B --
A A
Stack
--
-- (-->) C then A is popped and stack is empty, so we finished
