Insert element Split current tree with a value into left, right, Insert new node into the middle Merge left, node, right into root
(root: Node | None, value: int)
| 81 | |
| 82 | |
| 83 | def insert(root: Node | None, value: int) -> Node | None: |
| 84 | """ |
| 85 | Insert element |
| 86 | |
| 87 | Split current tree with a value into left, right, |
| 88 | Insert new node into the middle |
| 89 | Merge left, node, right into root |
| 90 | """ |
| 91 | node = Node(value) |
| 92 | left, right = split(root, value) |
| 93 | return merge(merge(left, node), right) |
| 94 | |
| 95 | |
| 96 | def erase(root: Node | None, value: int) -> Node | None: |
no test coverage detected