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
6c3f37fae7
commit
8710dff3aa
1 changed files with 1 additions and 1 deletions
|
|
@ -9,7 +9,7 @@ A doubly linked list implemented with Rust, it use [Reference counters](https://
|
|||
## 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.
|
||||
It implements the 3 most common traversals for binary trees: Inorder, postorder and preorder.
|
||||
|
||||

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