BinaryNode

Represents a binary node in a Merkle Patricia Trie

A binary node contains exactly two children, commonly used in Merkle trees to represent internal nodes that split paths into left and right branches. This structure is fundamental for Starknet’s storage proof verification.

Fields

• left - Hash of the left child node
• right - Hash of the right child node

Fully qualified path: alexandria_merkle_tree::storage_proof::BinaryNode

[derive(Drop, Serde)]
pub struct BinaryNode { /* private fields */ }