Triple order traversal of a binary tree in python

Python program for Triple order traversal of a binary tree. Here mentioned other language solution.

#  Python 3 program for
#  Triple order traversal of a binary tree

#  Binary Tree node
class TreeNode :
    def __init__(self, data) :
        #  Set node value
        self.data = data
        self.left = None
        self.right = None
class BinaryTree :
    def __init__(self) :
        #  Set initial tree root
        self.root = None
    def tripleOrder(self, node) :
        if (node != None) :
            #  Print preorder node
            print(node.data, end =" ")
            #  Visit left subtree
            self.tripleOrder(node.left)
            #  Print inorder node
            print(node.data, end =" ")
            #  Visit right subtree
            self.tripleOrder(node.right)
            #  Print postorder node
            print(node.data, end =" ")
def main() :
    #  Create new binary trees
    tree = BinaryTree()
    #         4    
    #        / \                         
    #       /   \    
    #     -4     7    
    #     / \     \               
    #    2   3     1
    #       / \   / 
    #      6   8 5
    #     /       
    #    9          
    #  ----------------------
    #  Constructing binary tree
    tree.root = TreeNode(4)
    tree.root.left = TreeNode(-4)
    tree.root.left.right = TreeNode(3)
    tree.root.left.right.left = TreeNode(6)
    tree.root.left.right.left.left = TreeNode(9)
    tree.root.left.right.right = TreeNode(8)
    tree.root.left.left = TreeNode(2)
    tree.root.right = TreeNode(7)
    tree.root.right.right = TreeNode(1)
    tree.root.right.right.left = TreeNode(5)
    #  Print triple order
    #  ----------------------------------
    #  4 -4 2 2 2 -4 3 6 9 9 9 6 6 3 8 8 ..
    #  8 3 -4 4 7 7 1 5 5 5 1 1 7 4
    tree.tripleOrder(tree.root)


if __name__=="__main__":
    main()

Output

4 -4 2 2 2 -4 3 6 9 9 9 6 6 3 8 8 8 3 -4 4 7 7 1 5 5 5 1 1 7 4