<aside> 📖 Tree is an undirected and connected graph. There's a unique path from 2 vertices.

</aside>

Full m-ary trees

M-ary tree is a tree has at most m children in every node.

<aside> 📖 A m-ary tree will have $m^h$ leaves.

</aside>

$h\ge log_m{l}$ where $h$ is height and $l$ is leaves.

"=" xảy ra khi đó là full m-ary và balanced.

Full m-ary tree is a tree has exactly m children in every node.

Properties of Trees

$n$ vertices has $n-1$ edges

In full-mary tree:

• $n = mi + 1$
• $n=i+l$

where:

• $n$: number of vertices
• $m$: number of children of every node.
• $i$: number of internal nodes (even root).
• $l$: number of leaves.