Compare commits
5 commits
42910bca86
...
691cf704f4
Author | SHA1 | Date | |
---|---|---|---|
Bruno BELANYI | 691cf704f4 | ||
Bruno BELANYI | aa72b269c2 | ||
Bruno BELANYI | eaaa9c9ae2 | ||
Bruno BELANYI | b3ed39eef3 | ||
Bruno BELANYI | aee1fa55c8 |
|
@ -48,27 +48,29 @@ Splitting a tree means taking a key, and getting the following output:
|
|||
```python
|
||||
type OptionalNode[K, V] = Node[K, V] | None
|
||||
|
||||
def split(
|
||||
root: OptionalNode[K, V],
|
||||
key: K,
|
||||
) -> tuple[OptionalNode[K, V], OptionalNode[K, V], OptionalNode[K, V]]:
|
||||
class SplitResult(NamedTuple):
|
||||
left: OptionalNode
|
||||
node: OptionalNode
|
||||
right: OptionalNode
|
||||
|
||||
def split(root: OptionalNode[K, V], key: K) -> SplitResult:
|
||||
# Base case, empty tree
|
||||
if root is None:
|
||||
return None, None, None
|
||||
return SplitResult(None, None, None)
|
||||
# If we found the key, simply extract left and right
|
||||
if root.key == key:
|
||||
left, right = root.left, root.right
|
||||
root.left, root.right = None, None
|
||||
return left, root, right
|
||||
return SplitResult(left, root, right)
|
||||
# Otherwise, recurse on the corresponding side of the tree
|
||||
if root.key < key:
|
||||
left, node, right = split(root.right, key)
|
||||
root.right = left
|
||||
return root, node, right
|
||||
return SplitResult(root, node, right)
|
||||
if key < root.key:
|
||||
left, node, right = split(root.left, key)
|
||||
root.left = right
|
||||
return left, node, root
|
||||
return SplitResult(left, node, root)
|
||||
raise RuntimeError("Unreachable")
|
||||
```
|
||||
|
||||
|
|
Loading…
Reference in a new issue