def test_node_with_one_smaller_child_is_max_heap(self):
child_node = Node(5)
node = Node(10, left=child_node, right=None)
self.assertTrue(node.is_max_heap())
node = Node(10, left=None, right=child_node)
self.assertTrue(node.is_max_heap())
def test_node_with_one_equal_child_is_min_heap(self):
child_node = Node(10)
node = Node(10, left=child_node, right=None)
self.assertTrue(node.is_min_heap())
node = Node(10, left=None, right=child_node)
self.assertTrue(node.is_min_heap())
def test_node_with_smaller_children_is_max_heap(self):
left_child = Node(1)
right_child = Node(2)
node = Node(10, left=left_child, right=right_child)
self.assertTrue(node.is_max_heap())
def test_node_with_both_children(self):
node = Node('root', Node('left'), Node('right'))
self.assertIsNotNone(node.right_child)
self.assertIsNotNone(node.left_child)
self.assertEqual('right', node.right_child.value)
self.assertEqual('left', node.left_child.value)
def test_single_node_is_min_heap(self):
node = Node('single')
self.assertTrue(node.is_min_heap())
def test_min_heapify(self):
n_value, l_value, r_value = 10, 20, 5
node = Node(n_value, left=Node(l_value), right=Node(r_value))
self.assertFalse(node.is_min_heap())
node.heapify(heap_type=HEAP_TYPE.MIN)
self.assertTrue(node.is_min_heap())
def test_node_with_no_children(self):
node = Node('value')
self.assertEqual('value', node.value)
self.assertIsNone(node.left_child)
self.assertIsNone(node.right_child)
def test_node_has_both_children(self):
node = Node(10, left=Node(5), right=Node(2))
expected = (node.has_left_child() and node.has_right_child())
self.assertTrue(expected)
def test_node_has_right_child(self):
node = Node(10, left=None, right=Node(2))
self.assertTrue(node.has_right_child())
self.assertFalse(node.has_left_child())
def test_node_with_equal_children_is_min_heap(self):
left_child = Node(10)
right_child = Node(10)
node = Node(10, left=left_child, right=right_child)
self.assertTrue(node.is_min_heap())
def test_node_with_bigger_children_is_min_heap(self):
left_child = Node(11)
right_child = Node(22)
node = Node(1, left=left_child, right=right_child)
self.assertTrue(node.is_min_heap())
import unittest
from DS.tree.tree_node import AbstractTreeNode as Node
from DS.tree.constants import HEAP_TYPE
heap_test_cases = [{
'node': Node(10, left=Node(2), right=Node(1)),
'is_max_heap': True,
'is_min_heap': False
}, {
'node': Node(10, left=Node(20), right=Node(5)),
'is_max_heap': False,
'is_min_heap': False
}, {
'node': Node(10, left=Node(20), right=Node(100)),
'is_max_heap': False,
'is_min_heap': True
}]
class NodeTests(unittest.TestCase):
def test_empty_value_raises_TypeError(self):
self.assertRaises(TypeError, Node, None)
def test_node_with_no_children(self):
node = Node('value')
self.assertEqual('value', node.value)
self.assertIsNone(node.left_child)
self.assertIsNone(node.right_child)
def test_node_with_left_child(self):
node = Node('root', Node('left'))