//! # Sparse Merkle Tree
//!
//! This crate contains an implementation of a **Sparse Merkle Tree** as a full binary tree:
//! a binary tree which every node other than the leaves has two children. It depends
//! on three traits: **merge**, required to create new nodes for the tree; **types**, needed for
//! identifying each node; and **storage**, which provides a database interface to store the state
//! of the tree. By default, **Sparse Merkle Tree** will use *blake2b* from *'enchainte-merge'* crate,
//! *h256* from *'enchainte-types'* and *kv_rocks* from *'enchainte-storage'* objects, which implement
//! the mentioned traits.
//!
//!
pub mod error;

pub mod node;

pub mod tree;

pub mod proof;