binaryTree1.root.left.left = Node('1') binaryTree1.root.left.right = Node('3') binaryTree1.root.right = Node('6') binaryTree1.root.right.right = Node('7') binaryTree1.root.right.left = Node('5') """ assigning root value of tree in variable""" a = binaryTree.root #preorderTraversal of binary tree : root-left-right print('\n') print("preorderList ->", binaryTree.preorderTraversal(a, binaryTree.preorderList)) #PostorderTraversal of binary tree : left-right-root print('\n') print("PostorderTraversal ->", binaryTree.postorderTraversal(a, binaryTree.postorderList)) #InorderTraversal of binarey tree left:root:rigth print('\n') print("InorderTraversal ->", binaryTree.InorderTraversal(a, binaryTree.inorderList)) #TotalnonLeafNode of binary tree print('\n') print("countOfNonLeafNode->", len(binaryTree.countOfNonLeafNode(a))) #TotalLeafNode of binary tree print('\n') print("countOfLeafNode->", len(binaryTree.countOfLeafNode(a))) #Total height of binary tree