from Node import Node; from BinarySearchTree import BST; bst = BST(); bst.insert(12); bst.insert(10); bst.insert(-2); bst.insert(1); bst.traverseInOrder(); print(bst.getMin()); bst.remove(10); bst.traverseInOrder();
# bst.traverseInOrder() # bst.remove(10) # print ("\n") # bst.traverseInOrder() # print ("\n") while 1: b = input( " 1. Add number to binarytree \n 2. Remove number \n 3. Print binarytree \n 4. Print Max \n 5. Print Min \n 6. Exit \n Enter your choice: " ) if b == 1: c = input("\n Enter the number: ") bst.insert(c) elif b == 2: c = input("Enter the number you want to remove: ") bst.remove(c) elif b == 3: bst.traverseInOrder() elif b == 4: print(bst.getMax()) elif b == 5: print(bst.getMin()) elif b == 6: exit() else: print("Enter a valid choice!!")
def testRemoveRootOne(): _tree = BST() _tree.insert(7) _tree.remove(7) assert _tree.is_empty()
# For passing DS from BinarySearchTree import BST; bst = BST() print("--- Prints the entire insert in ascending order ---") bst.insert(12) bst.insert(10) bst.insert(-2) bst.insert(1) # Let's order the nodes/values bst.traverseInOrder() print("--- Testing Remove Method---") # Let's try to remove bst.remove(10) bst.traverseInOrder() # print("--- Testing getMax Method---") # print(bst.getMax()) print("--- Testing getMin Method---") print(bst.getMin())