in Graph Theory retagged by
499 views
0 votes
0 votes

in Graph Theory retagged by
by
499 views

4 Comments

1) lower bound 3 upper bound 21 ?
Not sure..
1
1
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
0
Can you please provide a diagram?
1
1

MiNiPanda, added as answer

0
0

1 Answer

1 vote
1 vote

M-ARY tree means it can not have more than M childrens...

 

edited by

4 Comments

edited by

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
2
again i missed the term "FULL".

@ MiNiPanda, today you identified 3 mistakes of mine... Thank u so muchhh
0
0
haha :P it's okay..i do these mistakes during exams :P
0
0
bro, updated in answer
1
1
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true