In: Advanced Math
Let T = (V,E) be a tree, and letr, r′ ∈ V be any two nodes. Prove that the height of the rooted tree (T, r) is at most twice the height of the rooted tree (T, r′).
Let T = (V,E) be a tree, and letr, r′ ∈ V be any two nodes. Prove that the height of the rooted tree (T, r) is at most twice the height of the rooted tree (T, r′).