0 votes 0 votes Graph Theory graph-theory kenneth-rosen + – eyeamgj asked Jul 7, 2018 retagged Oct 10, 2023 by Hira Thakur eyeamgj 479 views answer comment Share Follow See all 4 Comments See all 4 4 Comments reply MiNiPanda commented Jul 7, 2018 reply Follow Share 1) lower bound 3 upper bound 21 ? Not sure.. 1 votes 1 votes Shaik Masthan commented Jul 7, 2018 reply Follow Share 1) lower bound is 3 and upper bound is 81 if root height = 0 2) m=3 if balanced means all levels are filled 0 votes 0 votes MiNiPanda commented Jul 7, 2018 reply Follow Share Can you please provide a diagram? 1 votes 1 votes Shaik Masthan commented Jul 7, 2018 reply Follow Share @ MiNiPanda, added as answer 0 votes 0 votes Please log in or register to add a comment.
1 votes 1 votes M-ARY tree means it can not have more than M childrens... Shaik Masthan answered Jul 7, 2018 edited Jul 7, 2018 by Shaik Masthan Shaik Masthan comment Share Follow See all 4 Comments See all 4 4 Comments reply MiNiPanda commented Jul 7, 2018 i edited by MiNiPanda Jul 7, 2018 reply Follow Share But the definition of full m-ary says that other than leaf nodes all the nodes should have exactly m children. In your diag the nodes at level 0,1,2 are not leaf nodes yet they have only 1 child and not m children. https://en.wikipedia.org/wiki/K-ary_tree 2 votes 2 votes Shaik Masthan commented Jul 7, 2018 reply Follow Share again i missed the term "FULL". @ MiNiPanda, today you identified 3 mistakes of mine... Thank u so muchhh 0 votes 0 votes MiNiPanda commented Jul 7, 2018 reply Follow Share haha :P it's okay..i do these mistakes during exams :P 0 votes 0 votes Shaik Masthan commented Jul 7, 2018 reply Follow Share bro, updated in answer 1 votes 1 votes Please log in or register to add a comment.