Struct TreeNode 

pub struct TreeNode {
    pub id: [u8; 32],
    pub hash: [u8; 32],
    pub children: Vec<[u8; 32]>,
    pub leaf_data: Option<TreeLeafData>,
}

A node in the Merkle tree.

Can be either an internal node (has children) or a leaf node (has data).

Fields

id: [u8; 32]

Node ID - stable identifier derived from the node’s position/key in the tree.

For internal nodes: typically hash of path or concatenation of child keys. For leaf nodes: typically hash of the entity key. This ID remains stable even when content changes.

hash: [u8; 32]

Merkle hash - changes when subtree content changes.

For internal nodes: hash of all children’s hashes (propagates changes up). For leaf nodes: hash of the leaf data (key + value + metadata). Used for efficient comparison: if hashes match, subtrees are identical.

children: Vec<[u8; 32]>

Child node IDs (empty for leaf nodes).

Typically limited to MAX_CHILDREN_PER_NODE. Use is_valid() to check bounds after deserialization from untrusted sources.

leaf_data: Option<TreeLeafData>

Leaf data (present only for leaf nodes).

Implementations

impl TreeNode

pub fn internal(id: [u8; 32], hash: [u8; 32], children: Vec<[u8; 32]>) -> Self

Create an internal node.

pub fn leaf(id: [u8; 32], hash: [u8; 32], data: TreeLeafData) -> Self

Create a leaf node.

pub fn is_valid(&self) -> bool

Check if node is within valid bounds and structurally valid.

Call this after deserializing from untrusted sources. Validates:

• Children count within MAX_CHILDREN_PER_NODE
• Structural invariant: must have exactly one of children OR leaf_data
• Leaf data validity (value size within limits)

pub fn is_leaf(&self) -> bool

Check if this is a leaf node.

pub fn is_internal(&self) -> bool

Check if this is an internal node.

pub fn child_count(&self) -> usize

Get number of children (0 for leaf nodes).

Trait Implementations

impl BorshDeserialize for TreeNode

fn deserialize_reader<__R: Read>(reader: &mut __R) -> Result<Self, Error>

fn deserialize(buf: &mut &[u8]) -> Result<Self, Error>

Deserializes this instance from a given slice of bytes. Updates the buffer to point at the remaining bytes.

fn try_from_slice(v: &[u8]) -> Result<Self, Error>

Deserialize this instance from a slice of bytes.

fn try_from_reader<R>(reader: &mut R) -> Result<Self, Error>

where R: Read,

impl BorshSerialize for TreeNode

fn serialize<__W: Write>(&self, writer: &mut __W) -> Result<(), Error>

impl Clone for TreeNode

fn clone(&self) -> TreeNode

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for TreeNode

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl PartialEq for TreeNode

fn eq(&self, other: &TreeNode) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl StructuralPartialEq for TreeNode