mirror of
https://codeberg.org/JasterV/cool-data-structures.git
synced 2026-04-26 18:40:04 +00:00
Update README.md
This commit is contained in:
parent
e5cb89ab0b
commit
edb7a88593
1 changed files with 11 additions and 2 deletions
13
README.md
13
README.md
|
|
@ -1,6 +1,15 @@
|
|||
# Doubly Linked List
|
||||
# Cool data structures
|
||||
|
||||
A doubly linked list implemented with Rust!
|
||||
## Doubly Linked List
|
||||
|
||||
A doubly linked list implemented with Rust, it use [Reference counters](https://doc.rust-lang.org/stable/book/ch15-04-rc.html) and [Reference cells](https://doc.rust-lang.org/stable/book/ch15-05-interior-mutability.html) together to let multiple nodes own a node and modify it
|
||||
|
||||

|
||||
|
||||
## Sorted Binary Tree
|
||||
|
||||
A simple binary Tree which stores its elements in an ordered way.
|
||||
It has implemented the 3 most common traversals for binary trees: Inorder, postorder and preorder.
|
||||
|
||||

|
||||
|
||||
|
|
|
|||
Loading…
Reference in a new issue