A function that fills count array with count of nodes at every level of given binary tree
void getMaxWidthRecur ( Node node , int [ ] count , int level ) { if ( node != null ) { count [ level ] ++ ; getMaxWidthRecur ( node . left , count , level + 1 ) ; getMaxWidthRecur ( node . right , count , level + 1 ) ; } }