Binary Search Tree (Depth First Search & Breath First Search)

Question 1

Depth First -

Answer 1

Start at root, follow one branch as far as it will go then backtrack

Question 2

Breadth First -

Answer 2

Start a root, scan every node connected and then continue scanning from left to right.