Tree #1

What is the parent of node E?

• How many children does node B have?

• Who is the sibling of node C?

• Who are the children of node E?

• C

• D

• F

• G

• H

• Are node D and node F siblings?

• Yes

• No

• Who are descendants of C with the lowest depth?

• A path between two siblings contain exactly
  three nodes.

• True

• False

• What is the height of subtree rooted at node C?

• A path between two leaf nodes will always contain a root node.

• True

• False

• Write a path from a node with the highest depth to a node with the lowest depth.