You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: README.md
+1
Original file line number
Diff line number
Diff line change
@@ -22,6 +22,7 @@ It provides different trees implementations:
22
22
***KeyValue node**: extends the Value node and allows you to attach a key and a value to the node.
23
23
***Trie node**: extends the KeyValue node, a simple [Trie tree](https://en.wikipedia.org/wiki/Trie).
24
24
***Auto-balanced node**: extends the N-ary node and tries to keep the tree as symetric as possible. It automatically balance all the children as soon as they are added.
25
+
***Merkle node**: a tree in which every non-leaf node is labelled with the cryptographic hash of the labels of its child nodes.
25
26
26
27
[4 trees traversal algorithms](https://en.wikipedia.org/wiki/Tree_traversal):
0 commit comments