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')
Min = binaryTree.findMinOnBT(a)
Max = binaryTree.findMaxonBt(a)
print("IsValidBst ->", binaryTree.IsValidBst(a, Max, Min))
#Check if two binary tree isStructurallyIdentical or not
print('\n')
print("isStructurallyIdentical ->",
binaryTree.isStructurallyIdentical(a, binaryTree1.root))
# for finding the deepest node of the binary tree.
print('\n')
print("deepest Node of Tree is ->", binaryTree.deepestNode(a))
# finding the number of leaves in the binary tree without using recursion.
print('\n')
print("numberOfLeaveslnBTusingLevelOrder->",
binaryTree.numberOfLeaveslnBTusingLevelOrder(a))
