Convert the given tree to a tree where each node is logical AND of its children The main idea is to do Postorder traversal
def convertTree ( root ) : NEW_LINE INDENT if ( root == None ) : NEW_LINE INDENT return NEW_LINE DEDENT DEDENT