Trees

Trees implementations

merkle_tree

10.0

A hash tree or Merkle tree is a tree in which every non-leaf node is labelled with the hash of the labels or values (in case of leaves) of its child nodes. Hash trees are useful because they allow efficient and secure verification of the contents of large data structures.

Popularity

Stargazers
97
Watchers
4
Forks
16

Downloads

Yesterday
0
Last 7 days
110
All Time
41,392

Activity

Open Issues
1
Open PRs
0
Merged PRs
12

Releases

Latest Version
2.0.0
Last Update
January 30, 2020

red_black_tree

4.7

Red-Black trees: an ordered key-value store with O(log(N)) performance

Popularity

Stargazers
38
Watchers
3
Forks
14

Downloads

Yesterday
0
Last 7 days
26
All Time
1,564

Activity

Open Issues
7
Open PRs
0
Merged PRs
3

Releases

Latest Version
1.2.0
Last Update
July 07, 2015

nary_tree

1.8

NaryTree implements the data structure for n-ary tree (also called rose tree), where each node in the tree can have zero or more children. NaryTree provides methods for traversal and manipulation of the tree structure and node contents.

Popularity

Stargazers
16
Watchers
1
Forks
4

Downloads

Yesterday
0
Last 7 days
2,942
All Time
16,050

Activity

Open Issues
0
Open PRs
0
Merged PRs
1

Releases

Latest Version
0.1.1
Last Update
September 19, 2018

zipper_tree

1.6

Methods for travelsal and modification of Trees using a zipper.

Popularity

Stargazers
18
Watchers
1
Forks
0

Downloads

Yesterday
0
Last 7 days
28
All Time
10,943

Activity

Open Issues
0
Open PRs
0
Merged PRs
0

Releases

Latest Version
0.1.1
Last Update
February 11, 2015