def setUp(self):
     self._splay_tree = SplayTree()
     self._splay_tree.insert(key=5, obj=5)
     self._splay_tree.insert(key=8, obj=8)
     self._splay_tree.insert(key=7, obj=7)
     self._splay_tree.insert(key=9, obj=9)
     self._splay_tree.insert(key=10, obj=10)
     self._splay_tree.insert(key=2, obj=2)
     self._splay_tree.insert(key=1, obj=1)
     self._splay_tree.insert(key=3, obj=3)
     self._splay_tree.insert(key=4, obj=4)
     self._splay_tree.insert(key=6, obj=6)
 def setUp(self):
     self._splay_tree = SplayTree()
 def setUp(self):
     self._splay_tree = SplayTree()
     self._splay_tree.insert(key=10, obj=10)
Exemplo n.º 4
0
 def __init__(self):
     self._st = SplayTree()
Exemplo n.º 5
0
    for key, value in tree.traversal(want_post_order=True):
        traversed.append((key, value))
    print('Tree postorder traversal (key, value) pairs:')
    print(traversed)


def print_tree_inorder(tree):
    traversed = []
    for key, value in tree.traversal(want_in_order=True):
        traversed.append((key, value))
    print('Tree inorder traversal (key, value) pairs:')
    print(traversed)


if __name__ == '__main__':
    bst = SplayTree()
    print('Node count is %s' % str(bst.node_count))
    print('Adding key value pairs (1, 1), (2, 2), .... (6, 6)')
    kvpairs = [(5, 5), (2, 2), (7, 7), (1, 1), (3, 3), (9, 9), (8, 8), (4, 4),
               (6, 6)]

    for kvpair in kvpairs:
        bst.insert(key=kvpair[0], obj=kvpair[1])

    print_tree_inorder(bst)
    print_tree_preorder(bst)
    print_tree_postorder(bst)

    #remove
    element_to_remove = 9
    print('removing element %s' % str(element_to_remove))
Exemplo n.º 6
0
 def setUp(self):
     self._splaytree = SplayTree()
     self._splaytree.insert(key=10, obj='Object value')