def test_insert_node_lt(self):
"""
Test insert_node inserts a less-than node to the
left child
:return:
"""
tmp_tree = Node(10)
insert_node(tmp_tree, 5)
assert 5 == tmp_tree.get_left().get_value()
def test_insert_node_gt(self):
"""
Test insert_node inserts a greater-than node to the
right child
:return:
"""
tmp_tree = Node(10)
insert_node(tmp_tree, 15)
assert 15 == tmp_tree.get_right().get_value()
def setUp(self):
self.tree0 = Node(23)
for v in [57, 5, 13, 103]:
insert_node(self.tree0, v)
self.tree1 = Node(30)
self.tree2 = Node(1)
for v in [2, 3, 5, 8, 13]:
insert_node(self.tree2, v)
def test_insert_node_gt(self):
"""
Test insert_node inserts a greater-than node to the
right child
:return:
"""
tmp_tree = Node(10)
insert_node(tmp_tree, 15)
assert 15 == tmp_tree.get_right().get_value()
def test_insert_node_lt(self):
"""
Test insert_node inserts a less-than node to the
left child
:return:
"""
tmp_tree = Node(10)
insert_node(tmp_tree, 5)
assert 5 == tmp_tree.get_left().get_value()
def setUp(self):
self.tree0 = Node(23)
for v in [57, 5, 13, 103]:
insert_node(self.tree0, v)
self.tree1 = Node(30)
self.tree2 = Node(1)
for v in [2, 3, 5, 8, 13]:
insert_node(self.tree2, v)
def setUp(self):
self.root = Node(23)
insert_node(self.root, 57)
insert_node(self.root, 5)
insert_node(self.root, 13)
insert_node(self.root, 103)
def setUp(self):
self.root = Node(23)
insert_node(self.root, 57)
insert_node(self.root, 5)
insert_node(self.root, 13)
insert_node(self.root, 103)
