A tree that can have maximum m child nodes is called m-ary tree.
Strict m-ary tree : A tree must have all nodes with either 0 or m child nodes.
Nodes vs Height of m-ary tree :
Internal Nodes vs External Nodes :
Number of external nodes = (m-1) * internal nodes + 1
Comments
Post a Comment