#binary-tree #tree #binary

compt

A complete binary tree visitor library

34 stable releases

2.1.0 May 20, 2022
2.0.1 Mar 27, 2022
1.10.2 Dec 31, 2021
1.10.1 Feb 7, 2021
0.1.1 Dec 1, 2017

#697 in Data structures

Download history 26/week @ 2024-12-04 45/week @ 2024-12-11 13/week @ 2024-12-18 9/week @ 2025-01-01 50/week @ 2025-01-08 16/week @ 2025-01-15 18/week @ 2025-01-22 28/week @ 2025-01-29 83/week @ 2025-02-05 33/week @ 2025-02-12 43/week @ 2025-02-19 32/week @ 2025-02-26 10/week @ 2025-03-05 22/week @ 2025-03-12 49/week @ 2025-03-19

117 downloads per month
Used in 6 crates (3 directly)

MIT license

36KB
895 lines

Summary

A library that provides a complete binary tree visitor trait with common default implementations for visiting strategies such as dfs_inorder or dfs preorder, etc. It also provides two flavors of a complete binary tree data structure with mutable and immutable visitors that implement the visitor trait.

No runtime deps