Stores the required count of nodes for each level
int [ ] levelResult = new int [ numLevels ] ; findNodes ( root , levelMin , levelResult , 0 ) ; for ( int i = 0 ; i < numLevels ; i ++ ) { Console . Write ( levelResult [ i ] + " ▁ " ) ; } }