Exemple #1
0
from BinarySearchTree import BinarySearchTree

tree = BinarySearchTree()

tree.insert(32)
tree.insert(55)
tree.insert(79)
tree.insert(10)
tree.insert(1)
tree.insert(0)
tree.insert(19)
tree.insert(16)
tree.insert(23)

#tree.inOrderTraversal();
tree.inOrderTraversalWithStack();