<<< Balanced Tree

1. Properties of Balanced Tree: e.g. 

1. A heap is also a type of balanced tree

2. Two tree structures of balanced trees: e.g.

1. AVL tree: e.g.

1. AVL tree

2. Non-AVL tree: e.g.  difference in depth is two or more

2. B tree

1. Properties: e.g.

1. All leaves are at the same level

2. Each element in the node is sorted

3. In each node (including the root), the number of child nodes is "number of elements + 1"

#Programming #Algorithm #CodeAnalysis #BalancedTree #AbdurRahimRatulAliKhan

>>>