hw5 - , 3 . (b). Determine the BFS tree of K 3 , 3 ....

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
AMS 301.2 (Spring, 2011) Estie Arkin Homework Set # 5 Due in class on Tuesday, March 15, 2011. Recommended Reading: Tucker, 3.1, 3.2 Do Problems: Problem A: Let T be a balanced 5-ary tree with 81 nodes. (a). How many internal nodes does T have? (b). How many edges does the tree T have? (c). What is the height of T ? 16, 26(a) — Section 3.1 Problem B: (a). Determine the DFS tree of K 3
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: , 3 . (b). Determine the BFS tree of K 3 , 3 . problem C: True or False? If true, give a short proof. If false, give a counterexample: (a). For any connected graph G , all internal nodes of the BFS tree on G have the same number of children. (b). For any connected graph G , the DFS tree on G and the BFS tree on G have the same number of edges....
View Full Document

This note was uploaded on 05/28/2011 for the course AMS 301 taught by Professor Estie during the Spring '11 term at University of Florida.

Ask a homework question - tutors are online