tree.add(3) tree.add(14) tree.add(13) tree.add(1) tree.add(6) tree.add(4) tree.add(7) ''' tree.show_in_order(tree.root) print("*"*5) tree.show_pos_order(tree.root) print("*"*5) tree.show_pre_order(tree.root) ''' print(tree.search(tree.root, 8).value) """ En orden izquierda-raiz-derecho 1,3,4,5,7,8,10,13,14 En Pos orden izquierda-derecha-raiz 1,4,7,6,3,13,14,10,8 En Pre orden raiz-izquierda-derecha 8,3,1,6,4,7,10,14,13 """
from binarySearchTree import BinarySearchTree, Node tree = BinarySearchTree() tree.insert(tree.root, Node(34)) tree.insert(tree.root, Node(32)) tree.insert(tree.root, Node(39)) tree.insert(tree.root, Node(30)) print(tree.search(tree.root, 32)) print(tree.search(tree.root, 34)) print(tree.search(tree.root, 30)) print(tree.search(tree.root, 39))