# Binary tree and binary search tree

***Tree's level start with 0***

-If n is the root of T than n isat level 0.
-If n is not the root of T, its level is 1 greater
than the level of its parent.

***Tree's height start with 0***

-If T is empty, its height is 0.
-If T is not empty:
height(T) = 1 + max{height(TL), height(TR)}

***DIFFERENT TREE FORM***

# Practice 8-1, 8-2: