Traverses given tree in Inorder fashion and prints all nodes that have both children as non - empty .
def findFullNode ( root ) : NEW_LINE INDENT if ( root != None ) : NEW_LINE INDENT findFullNode ( root . left ) NEW_LINE if ( root . left != None and root . right != None ) : NEW_LINE INDENT print ( root . data , end = " ▁ " ) NEW_LINE DEDENT findFullNode ( root . right ) NEW_LINE DEDENT DEDENT