posts: treap: add search

This commit is contained in:
Bruno BELANYI 2024-07-20 19:23:00 +01:00
parent f981ee9903
commit 1539ed5ce9

View file

@ -79,3 +79,21 @@ class Treap[K, V]:
# The tree starts out empty
self._root = None
```
### Search
Searching the tree is the same as in any other _Binary Search Tree_.
```python
def get(self, key: K) -> T | None:
node = self._root
# The usual BST traversal
while node is not None:
if node.key == key:
return node.value
elif node.key < key:
node = node.right
else:
node = node.left
return None
```