Binary Trees Flashcards
1
Q
What is a binary tree?
A
Binary trees are trees where each node has either 0, 1 or
2 children.
2
Q
What is Breadth-first search?
A
When you visit each node in order of each level. (Root, all parent, all leaf etc.)
3
Q
What is depth-first search?
A
Depth-first searches travel recursively down to the leaves
and then back up.
