#Total height of binary tree print('\n') print("Height of Binary->", binaryTree.hightOfBinarytree(a)) #Check Strit binary trre exactly 0 or 2 children print('\n') print("Is it a StrictBinaryTree", binaryTree.checkStrictBinarytree(a)) #Diameter of binary tree print('\n') print("Diameter of Binary 1->", binaryTree.diameterOfbinarytree(a)) #Total Diameter of binary tree print('\n') print("Diameter of Binary 2->", binaryTree.optimizedDiameterOfBinaeryTree(a)) # level order Traversal of binary treee print('\n') print("levelorderTraversal ->", binaryTree.levelorderTraversal(a)) # all path root to leaf print('\n') b = binaryTree.path c = BinaryTree.listOfPath print("DetermindAllPathRootToLeaf ->", binaryTree.DetermindAllPathRootToLeaf(a, b)) # Find Mininum Node value in binary trree print('\n') print("findMinOnBT ->", binaryTree.findMinOnBT(a))