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))
# Find Maximum Node value in binary trree
print('\n')
print("findMaxonBt ->", binaryTree.findMaxonBt(a))
# Find Least comman ancesstor
print('\n')
print("GetLCA ->", binaryTree.GetLCA(a, '1', '7'))
#Check if it is valid binary tree or NodeStructure
print('\n')
