|
| 1 | +import pytest |
| 2 | + |
| 3 | +from leetcode_py.tree_node import TreeNode, build_anytree |
| 4 | + |
| 5 | + |
| 6 | +class TestTreeNode: |
| 7 | + @pytest.mark.parametrize( |
| 8 | + "val,expected_val", |
| 9 | + [ |
| 10 | + (None, 0), # default |
| 11 | + (5, 5), # with value |
| 12 | + ], |
| 13 | + ) |
| 14 | + def test_init(self, val, expected_val): |
| 15 | + node = TreeNode() if val is None else TreeNode(val) |
| 16 | + assert node.val == expected_val |
| 17 | + assert node.left is None |
| 18 | + assert node.right is None |
| 19 | + |
| 20 | + def test_init_with_children(self): |
| 21 | + left = TreeNode(1) |
| 22 | + right = TreeNode(2) |
| 23 | + node = TreeNode(0, left, right) |
| 24 | + assert node.val == 0 |
| 25 | + assert node.left == left |
| 26 | + assert node.right == right |
| 27 | + |
| 28 | + def test_from_list_empty(self): |
| 29 | + result = TreeNode.from_list([]) |
| 30 | + assert result is None |
| 31 | + |
| 32 | + def test_from_list_none_root(self): |
| 33 | + result = TreeNode.from_list([None]) |
| 34 | + assert result is None |
| 35 | + |
| 36 | + def test_from_list_single(self): |
| 37 | + result = TreeNode.from_list([1]) |
| 38 | + assert result is not None |
| 39 | + assert result.val == 1 |
| 40 | + assert result.left is None |
| 41 | + assert result.right is None |
| 42 | + |
| 43 | + def test_from_list_complete_tree(self): |
| 44 | + result = TreeNode.from_list([1, 2, 3, 4, 5, 6, 7]) |
| 45 | + assert result is not None |
| 46 | + assert result.val == 1 |
| 47 | + assert result.left is not None |
| 48 | + assert result.left.val == 2 |
| 49 | + assert result.right is not None |
| 50 | + assert result.right.val == 3 |
| 51 | + assert result.left.left is not None |
| 52 | + assert result.left.left.val == 4 |
| 53 | + assert result.left.right is not None |
| 54 | + assert result.left.right.val == 5 |
| 55 | + assert result.right.left is not None |
| 56 | + assert result.right.left.val == 6 |
| 57 | + assert result.right.right is not None |
| 58 | + assert result.right.right.val == 7 |
| 59 | + |
| 60 | + def test_from_list_sparse_tree(self): |
| 61 | + result = TreeNode.from_list([1, None, 2]) |
| 62 | + assert result is not None |
| 63 | + assert result.val == 1 |
| 64 | + assert result.left is None |
| 65 | + assert result.right is not None |
| 66 | + assert result.right.val == 2 |
| 67 | + assert result.right.left is None |
| 68 | + assert result.right.right is None |
| 69 | + |
| 70 | + @pytest.mark.parametrize( |
| 71 | + "input_list,expected_output", |
| 72 | + [ |
| 73 | + ([1], [1]), |
| 74 | + ([1, 2, 3, 4, 5, 6, 7], [1, 2, 3, 4, 5, 6, 7]), |
| 75 | + ([1, None, 2], [1, None, 2]), |
| 76 | + ], |
| 77 | + ) |
| 78 | + def test_to_list(self, input_list, expected_output): |
| 79 | + node = TreeNode.from_list(input_list) |
| 80 | + assert node is not None |
| 81 | + assert node.to_list() == expected_output |
| 82 | + |
| 83 | + @pytest.mark.parametrize( |
| 84 | + "input_list,expected_values", |
| 85 | + [ |
| 86 | + ([1], ["1"]), |
| 87 | + ([1, 2, 3], ["1", "2", "3"]), |
| 88 | + ], |
| 89 | + ) |
| 90 | + def test_str_representation(self, input_list, expected_values): |
| 91 | + node = TreeNode.from_list(input_list) |
| 92 | + assert node is not None |
| 93 | + result = str(node) |
| 94 | + for val in expected_values: |
| 95 | + assert val in result |
| 96 | + |
| 97 | + def test_repr_representation(self): |
| 98 | + node = TreeNode.from_list([1, 2, 3]) |
| 99 | + assert node is not None |
| 100 | + assert repr(node) == "TreeNode([1, 2, 3])" |
| 101 | + |
| 102 | + def test_repr_html_generates_svg(self): |
| 103 | + node = TreeNode.from_list([1, 2, 3]) |
| 104 | + assert node is not None |
| 105 | + result = node._repr_html_() |
| 106 | + assert isinstance(result, str) |
| 107 | + assert "svg" in result.lower() |
| 108 | + |
| 109 | + @pytest.mark.parametrize( |
| 110 | + "list1,list2,should_equal", |
| 111 | + [ |
| 112 | + ([1, 2, 3], [1, 2, 3], True), |
| 113 | + ([1, 2, 3], [1, 3, 2], False), |
| 114 | + ], |
| 115 | + ) |
| 116 | + def test_equality(self, list1, list2, should_equal): |
| 117 | + node1 = TreeNode.from_list(list1) |
| 118 | + node2 = TreeNode.from_list(list2) |
| 119 | + assert node1 is not None |
| 120 | + assert node2 is not None |
| 121 | + assert (node1 == node2) == should_equal |
| 122 | + |
| 123 | + @pytest.mark.parametrize("other_value", [[1], "1"]) |
| 124 | + def test_equality_different_types(self, other_value): |
| 125 | + node = TreeNode(1) |
| 126 | + assert node != other_value |
| 127 | + |
| 128 | + @pytest.mark.parametrize( |
| 129 | + "test_list", |
| 130 | + [ |
| 131 | + [1, 2, 3, 4, 5, None, 6], |
| 132 | + [1], |
| 133 | + [1, None, 2], |
| 134 | + ], |
| 135 | + ) |
| 136 | + def test_roundtrip_conversion(self, test_list): |
| 137 | + node = TreeNode.from_list(test_list) |
| 138 | + assert node is not None |
| 139 | + result = node.to_list() |
| 140 | + assert result == test_list |
| 141 | + |
| 142 | + def test_build_anytree_none(self): |
| 143 | + result = build_anytree(None) |
| 144 | + assert result is None |
| 145 | + |
| 146 | + def test_build_anytree_single_node(self): |
| 147 | + node = TreeNode(1) |
| 148 | + result = build_anytree(node) |
| 149 | + assert result is not None |
| 150 | + assert result.name == "1" |
| 151 | + assert len(result.children) == 0 |
| 152 | + |
| 153 | + def test_str_with_none_tree(self): |
| 154 | + # Create a scenario where build_anytree returns None |
| 155 | + # This happens when we have a node but build_anytree fails |
| 156 | + import unittest.mock |
| 157 | + |
| 158 | + with unittest.mock.patch("leetcode_py.tree_node.build_anytree", return_value=None): |
| 159 | + node = TreeNode(1) |
| 160 | + result = str(node) |
| 161 | + assert result == "None" |
0 commit comments