Binary Trees

Question 1

What is a binary tree?

Answer 1

Binary trees are trees where each node has either 0, 1 or

2 children.

Question 2

What is Breadth-first search?

Answer 2

When you visit each node in order of each level. (Root, all parent, all leaf etc.)

Question 3

What is depth-first search?

Answer 3

Depth-first searches travel recursively down to the leaves

and then back up.