Inorder Traversal Search minimum element in each level and store it into vector array .
def printPerLevelMinimum ( root , res , level ) : NEW_LINE INDENT if ( root != None ) : NEW_LINE INDENT res = printPerLevelMinimum ( root . left , res , level + 1 ) ; NEW_LINE if ( root . data < res [ level ] ) : NEW_LINE INDENT res [ level ] = root . data ; NEW_LINE DEDENT res = printPerLevelMinimum ( root . right , res , level + 1 ) ; NEW_LINE DEDENT return res NEW_LINE DEDENT def perLevelMinimumUtility ( root ) : NEW_LINE