CMTree

A Cartesian Merkle Tree combining binary search tree, heap, and Merkle tree properties.

The tree maintains three invariants simultaneously: 1. BST Property: Left subtree keys < node key < right subtree keys 2. Heap Property: Parent priority >= child priorities 3. Merkle Property: Each node’s hash depends on its key and children’s hashes

Fully qualified path: cartesian_merkle_tree::library::tree::CMTree

[derive(Drop, Copy, Debug)]
pub struct CMTree {
    pub root: Option<Box<CMTNode>>,
}

Members

root

The root node of the tree, None for empty trees

Fully qualified path: cartesian_merkle_tree::library::tree::CMTree::root

pub root: Option<Box<CMTNode>>