def PrintAscending(self):
BinarySearchTree.PrintAscending(self)
bst = BinarySearchTree()
print("Inserting Values into Binary Search Tree")
bst.Insert(100)
bst.Insert(150)
bst.Insert(50)
bst.Insert(25)
bst.Insert(125)
bst.Insert(75)
bst.Insert(175)
print("Insertion Successful!")
print("Binary Search Tree in Ascending Order:")
bst.PrintAscending()
print("Binary Search Tree in Descending Order:")
bst.PrintDescending()
print("Searching for 100 in BST:")
if bst.Find(100):
print("100 found in BST. Test successful")
else:
print("Test failed")
print("Searching for 125 in BST:")
if bst.Find(125):
print("125 found in BST. Test successful")
else:
print("Test failed")
