Binary Tree

Binary Tree Height and Depth
 * [Q] Balanced binary tree definition?
 * [A] A balanced binary tree has the minimum possible maximum height (a.k.a. depth) for the leaf nodes.
 * Binary Search Tree
 * The  depth  of a node is the number of edges from the node to the tree's root node. A root node will have a depth of 0.


 * The  height  of a node is the number of edges on the  longest path  from the node to a leaf. A leaf node will have a height of 0.
 * [Q] Height and depth of a balanced binary tree with n nodes

​
 * [A] min k such that n <= 2 ^ (k + 1) - 1 =>  height = depth = k