Ejemplo n.º 1
0
def built_binary_tree():
    node = Node(1)
    ret_tree = BinaryTree(node)
    two_node = Node(2)
    three_node = Node(3)
    ret_tree.insert(ret_tree.root, two_node)
    ret_tree.insert(ret_tree.root, three_node)
    return ret_tree
Ejemplo n.º 2
0
#! /usr/bin/env python

from Tree import Node, BinaryTree

tarray = [1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16]
mid = int(len(tarray)/2)
print("Mid: {}".format(mid))

rootnode = Node(tarray[mid])
print("rootnode: {}".format(rootnode))

bintree = BinaryTree(rootnode)
for j,item in enumerate(tarray):
    if item == tarray[mid]:
        continue
    in_node = Node(tarray[j])
    bintree.insert(bintree.root, in_node)

print("bintree in_order_traversal from root:")
bintree.in_order_traversal(bintree.root)
Ejemplo n.º 3
0
def build_ten_tree():
    node = Node(7)
    ret_tree = BinaryTree(node)
    one_node = Node(1)
    two_node = Node(2)
    three_node = Node(3)
    four_node = Node(4)
    five_node = Node(5)
    six_node = Node(6)
    seven_node = Node(7)
    eight_node = Node(8)
    nine_node = Node(9)
    ten_node = Node(10)
    ret_tree.insert(ret_tree.root, two_node)
    ret_tree.insert(ret_tree.root, three_node)
    ret_tree.insert(ret_tree.root, nine_node)
    ret_tree.insert(ret_tree.root, six_node)
    ret_tree.insert(ret_tree.root, one_node)
    ret_tree.insert(ret_tree.root, ten_node)
    ret_tree.insert(ret_tree.root, eight_node)
    return ret_tree
Ejemplo n.º 4
0
ret_tree = BinaryTree(node)
one_node = Node(1)
two_node = Node(2)
three_node = Node(3)
four_node = Node(4)
five_node = Node(5)
six_node = Node(6)
seven_node = Node(7)
eight_node = Node(8)
nine_node = Node(9)
ten_node = Node(10)
twelve_node = Node(12)
fourteen_node = Node(14)
eighteen_node = Node(18)

ret_tree.insert(ret_tree.root, two_node)
ret_tree.insert(ret_tree.root, three_node)
ret_tree.insert(ret_tree.root, nine_node)
ret_tree.insert(ret_tree.root, six_node)
ret_tree.insert(ret_tree.root, one_node)
ret_tree.insert(ret_tree.root, ten_node)
ret_tree.insert(ret_tree.root, eight_node)
#
# ten_tree = BinaryTree(ten_node)
# ten_tree.insert(ten_tree.root, five_node)
# ten_tree.insert(ten_tree.root, seven_node)
# ten_tree.insert(ten_tree.root, two_node)
# ten_tree.insert(ten_tree.root, twelve_node)
# ten_tree.insert(ten_tree.root, eighteen_node)
# ten_tree.insert(ten_tree.root, four_node)
# ten_tree.insert(ten_tree.root, fourteen_node)