Questions

a. Is a directed graph weakly connected if there is a path from a to b and from b to a whenever a and b are vertices in the graph? b. If two trees have the same number of vertices and the same degrees, are the two trees isomorphic?

Are these True, I need to understand them better

a. If T is a rooted binary tree of height 5, then T has at most 25 leaves. b. If T is a tree with 50 vertices, the largest degree that any vertex can have is 49.

InOrder Transversal

I cannot get the solution. Also, Can a tree have a Hamilton path?

Tree Questions

I need to know if these are true, and if so why. a.)In a rooted binary tree with 16 vertices, there must be a path of length 4. b.)No tree has a Hamilton path.

Prove the relation

Let p, p' be relations such that the range of p equals the domain of p'. Then p o p' (the composition of p and p') is defined as... Please look at the attached doc for rest of question.