| 1 | 1 | class Zipper: |
| 2 | | # Tree is a dict with keys "value" (int), "left" (dict or None), "right" (dict or None) |
| 2 | """ |
| 3 | A zipper for navigating and manipulating a binary tree. |
| 4 | |
| 5 | The zipper maintains a focus on a specific node in the tree, allowing for |
| 6 | efficient navigation and modification operations. |
| 7 | """ |
| 8 | def __init__(self, tree, breadcrumbs=None): |
| 9 | """ |
| 10 | Initialize a Zipper. |
| 11 | |
| 12 | Args: |
| 13 | tree: The tree node that is currently in focus |
| 14 | breadcrumbs: A list of breadcrumb dictionaries for tracking path back to root |
| 15 | """ |
| 16 | self.tree = tree |
| 17 | self.breadcrumbs = breadcrumbs or [] |
| 18 | |
| 3 | 19 | @staticmethod |
| 4 | 20 | def from_tree(tree: dict) -> "Zipper": |
| 5 | | pass |
| 6 | | |
| 21 | """ |
| 22 | Create a zipper from a binary tree. |
| 23 | |
| 24 | Args: |
| 25 | tree: A binary tree represented as a dict with keys "value", "left", and "right" |
| 26 | |
| 27 | Returns: |
| 28 | A new Zipper instance focused on the root of the tree |
| 29 | """ |
| 30 | # Edge Case: Handle None tree input |
| 31 | if tree is None: |
| 32 | return None |
| 33 | return Zipper(tree) |
| 34 | |
| 7 | 35 | def value(self) -> int: |
| 8 | | pass |
| 9 | | |
| 36 | """ |
| 37 | Get the value of the focus node. |
| 38 | |
| 39 | Returns: |
| 40 | The value of the current node |
| 41 | """ |
| 42 | return self.tree["value"] |
| 43 | |
| 10 | 44 | def set_value(self, value: int) -> "Zipper": |
| 11 | | pass |
| 12 | | |
| 45 | """ |
| 46 | Set the value of the focus node. |
| 47 | |
| 48 | Args: |
| 49 | value: The new value for the focus node |
| 50 | |
| 51 | Returns: |
| 52 | A new Zipper with the updated value |
| 53 | """ |
| 54 | # Edge Case: Handle None value |
| 55 | if value is None: |
| 56 | raise ValueError("Value cannot be None") |
| 57 | new_tree = { |
| 58 | "value": value, |
| 59 | "left": self.tree["left"], |
| 60 | "right": self.tree["right"] |
| 61 | } |
| 62 | return Zipper(new_tree, self.breadcrumbs) |
| 63 | |
| 13 | 64 | def left(self) -> "Zipper | None": |
| 14 | | pass |
| 15 | | |
| 65 | """ |
| 66 | Move the focus to the left child of the current node. |
| 67 | |
| 68 | Returns: |
| 69 | A new Zipper focused on the left child, or None if no left child exists |
| 70 | """ |
| 71 | # Edge Case: Handle missing left child |
| 72 | if self.tree["left"] is None: |
| 73 | return None |
| 74 | |
| 75 | # Create breadcrumb to remember how to get back to this node |
| 76 | breadcrumb = { |
| 77 | "parent": { |
| 78 | "value": self.tree["value"], |
| 79 | "right": self.tree["right"] |
| 80 | }, |
| 81 | "is_left": True |
| 82 | } |
| 83 | |
| 84 | return Zipper(self.tree["left"], self.breadcrumbs + [breadcrumb]) |
| 85 | |
| 16 | 86 | def set_left(self, tree: dict | None) -> "Zipper": |
| 17 | | pass |
| 18 | | |
| 87 | """ |
| 88 | Set the left child of the focus node. |
| 89 | |
| 90 | Args: |
| 91 | tree: The new left subtree (or None to remove the left child) |
| 92 | |
| 93 | Returns: |
| 94 | A new Zipper with the updated left child |
| 95 | """ |
| 96 | new_tree = { |
| 97 | "value": self.tree["value"], |
| 98 | "left": tree, |
| 99 | "right": self.tree["right"] |
| 100 | } |
| 101 | return Zipper(new_tree, self.breadcrumbs) |
| 102 | |
| 19 | 103 | def right(self) -> "Zipper | None": |
| 20 | | pass |
| 21 | | |
| 104 | """ |
| 105 | Move the focus to the right child of the current node. |
| 106 | |
| 107 | Returns: |
| 108 | A new Zipper focused on the right child, or None if no right child exists |
| 109 | """ |
| 110 | # Edge Case: Handle missing right child |
| 111 | if self.tree["right"] is None: |
| 112 | return None |
| 113 | |
| 114 | # Create breadcrumb to remember how to get back to this node |
| 115 | breadcrumb = { |
| 116 | "parent": { |
| 117 | "value": self.tree["value"], |
| 118 | "left": self.tree["left"] |
| 119 | }, |
| 120 | "is_left": False |
| 121 | } |
| 122 | |
| 123 | return Zipper(self.tree["right"], self.breadcrumbs + [breadcrumb]) |
| 124 | |
| 22 | 125 | def set_right(self, tree: dict | None) -> "Zipper": |
| 23 | | pass |
| 24 | | |
| 126 | """ |
| 127 | Set the right child of the focus node. |
| 128 | |
| 129 | Args: |
| 130 | tree: The new right subtree (or None to remove the right child) |
| 131 | |
| 132 | Returns: |
| 133 | A new Zipper with the updated right child |
| 134 | """ |
| 135 | new_tree = { |
| 136 | "value": self.tree["value"], |
| 137 | "left": self.tree["left"], |
| 138 | "right": tree |
| 139 | } |
| 140 | return Zipper(new_tree, self.breadcrumbs) |
| 141 | |
| 25 | 142 | def up(self) -> "Zipper | None": |
| 26 | | pass |
| 27 | | |
| 143 | """ |
| 144 | Move the focus to the parent of the current node. |
| 145 | |
| 146 | Returns: |
| 147 | A new Zipper focused on the parent node, or None if already at the root |
| 148 | """ |
| 149 | # Edge Case: Handle attempt to move up from root |
| 150 | if not self.breadcrumbs: |
| 151 | return None |
| 152 | |
| 153 | # Get the last breadcrumb |
| 154 | last_breadcrumb = self.breadcrumbs[-1] |
| 155 | parent = last_breadcrumb["parent"] |
| 156 | is_left = last_breadcrumb["is_left"] |
| 157 | |
| 158 | # Reconstruct the parent node with the current tree in the correct position |
| 159 | if is_left: |
| 160 | new_tree = { |
| 161 | "value": parent["value"], |
| 162 | "left": self.tree, |
| 163 | "right": parent["right"] |
| 164 | } |
| 165 | else: |
| 166 | new_tree = { |
| 167 | "value": parent["value"], |
| 168 | "left": parent["left"], |
| 169 | "right": self.tree |
| 170 | } |
| 171 | |
| 172 | return Zipper(new_tree, self.breadcrumbs[:-1]) |
| 173 | |
| 28 | 174 | def to_tree(self) -> dict: |
| 29 | | pass |
| 175 | """ |
| 176 | Get the entire binary tree from the zipper. |
| 177 | |
| 178 | Returns: |
| 179 | The complete binary tree as a dict |
| 180 | """ |
| 181 | # Navigate back to the root to get the complete tree |
| 182 | current = self |
| 183 | while current.breadcrumbs: |
| 184 | current = current.up() |
| 185 | return current.tree |
| 186 | |
| 187 | # Handled Edge Cases: None tree input, missing children, attempt to move up from root, None value input |