9 Let T Be A Complete M Ary Tree A If T Has Exactly Three Levels Prove That The Number Of Vertices Of T Must Be 1 1 (14.21 KiB) Viewed 29 times
only 9b is needed
9. Let T be a complete m-ary tree. (a) If T has exactly three levels. Prove that the number of vertices of T must be 1 + km, wher 2 sk sm +1. (b) If T has n vertices of which k are non-leaves and I are leaves. Prove that n = mk + 1 an 1 = (m - 1)k +1. 10. Use Polish notations to construct the trees for the following expressions. (a) (((2 x 7) +)(3-11)
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!