Q3 Which of the following are correct? (i) Every rooted tree

Last updated: 7/20/2022

Q3 Which of the following are correct? (i) Every rooted tree of height h has at least 2¹ nodes. (ii) Every rooted tree of height h has at most 2" nodes. (iii) Every tree can be rooted so that it has height at most [(n-1)/2]. (iv) If u, v are leaves of equal depth d in a rooted tree, then the length of the unique u-v-path (v0=u, V₁...,vi=v) is odd.