then recur on right child
convertTree ( root . right ) NEW_LINE if ( root . left != None and root . right != None ) : NEW_LINE INDENT root . data = ( ( root . left . data ) & ( root . right . data ) ) NEW_LINE DEDENT def printInorder ( root ) : NEW_LINE if ( root == None ) : NEW_LINE INDENT return NEW_LINE DEDENT