Discrete structures

4. (4 pts) Draw the tree obtained by the depth-first spanning tree algorithm applied to Kn 5. (6 pts) Find a full binary tree given the pre-order listing of the vertices: A, B, C, D, E, F, G, H, I (there is more than one answer, full means zero or two children only). 6. (6 pts) Prove that for any natural number, n, there is a binary tree with n terminal vertices where every vertex has 0 or 2 children (i.e that is full). 4. (4 pts) Draw the tree obtained by the depth-first spanning tree algorithm applied to Kn 5. (6 pts) Find a full binary tree given the pre-order listing of the vertices: A, B, C, D, E, F, G, H, I (there is more than one answer, full means zero or two children only). 6. (6 pts) Prove that for any natural number, n, there is a binary tree with n terminal vertices where every vertex has 0 or 2 children (i.e that is full)