Binary Trees
Perfect Binary Trees
Masing Masing Punya anak 2
Complete Binary Trees
Nyaris Semuanya punya anak
Skewed Binary Trees
Lurus aja
Rumus - Rumus penting
Max Height: n-1 || n = node
Min Height: 2log(n)
Max Number of Nodes: 2^(h+1)-1 || h = level, start from 0
Array in Binary Tree
No comments:
Post a Comment