Question: 3. Introduction to Trees (7 points) (1) (2 points) Which of the graphs G1, G2, G3, and G4 above are trees? (briefly justify your (2)

3. Introduction to Trees (7 points) (1) (2 points) Which of the graphs G1, G2, G3, and G4 above are trees? (briefly justify your (2) (5 points) Use induction on l to show that for all 21, a full binary tree with I leaves has answers 2l - 1 vertices total
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
