-
The following code:
```python
bst = RedBlackTree()
bst.insert(1)
bst.insert(2)
bst.insert(3)
bst.print_tree()
```
produces the following output:
```
R---- 2(BLACK)
L---- 1(RED)
…
-
Wish your latest project a good luck Łukasz!
I just had a look at its icon, red backdrop behind a symmetrical black tree, having 5 wrench branches -- resulting the tree in having 10 pointy ends.
I…
-
### Data Structures
- [ ] Red black binary trees (see https://github.com/factor/factor/issues/1753)
- can use with multisets (choice of avl tree or red-black tree)
- [ ] [Zip trees](https://arxiv…
-
Hello! Can you tell me what the problem is? As a result, the object was not deleted in the video, but became covered in black. The input data were videos and videos with a mask without an alpha channe…
-
The current naive implementation is $O(n^2)$, whereas [Bentley–Ottmann](https://en.wikipedia.org/wiki/Bentley%E2%80%93Ottmann_algorithm) is $O((n+k)\log n)$. Plans to implement?
-
The counterpart of `recv_buf` in linux kernel is called out-of-order queue, which is often shortened as _ofo queue_. That queue is implemented by a red-black tree so that every time the insertion into…
-
Goals:
- [X] Binary Search Tree.
- [x] AVL Tree.
- [X] Red-Black Tree.
- [ ] B Tree.
- [ ] B+ Tree.
- [x] Threaded Binary Tree.
- [x] Trie.
- [ ] Radix Tree.
-
__Problem:__
Totality checker seems to have a bug. Specifically, the Idris totality checker thinks this function is not total:
```idris
blacken : Tree d c a -> Tree (incrBlack d (inv c)) Black …
-
- binary-tree
- [x] build tree
- [x] rotate
- [x] traversal
- [x] dump
- [ ] show
- binary-search-tree
- [ ] insert
- [ ] remove #30
- [x] search
- red-black…
-
I want to add more data structures in C language like (Red Black Tree, AVL tree)
Can you please assign this issue to me so I can work on this Issue?
Thank You.