- 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 (17.21 KiB) Viewed 35 times
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 +
-
answerhappygod
- Site Admin
- Posts: 899604
- Joined: Mon Aug 02, 2021 8:13 am
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 +
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, where 2 ≤k ≤ m +1. (b) If T has n vertices of which k are non-leaves and I are leaves. Prove that n = mk + 1 and 1 = (m - 1)k +1. 10. Use Polish notations to construct the trees for the following expressions. (a) (((2 x 7) + x) + y) = (3-11) (b) (3-(2-(11-(9-4))))÷(2+3(+4(+7)))
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!