Struct CollatzTree 

pub struct CollatzTree {
    pub root: TreeNode,
    pub limit: u64,
}

The full reverse Collatz tree: starting from 1, build upward. Each node n has child 2n (always), and child (n-1)/3 if n ≡ 1 mod 3 and (n-1)/3 is odd and > 0.

Fields

root: TreeNode

limit: u64

Implementations

impl CollatzTree

pub fn build(limit: u64) -> Self

Build the reverse Collatz tree up to a given limit on node values.

pub fn flatten(&self) -> Vec<(u64, usize)>

Flatten the tree into a list of (value, depth) pairs.

pub fn node_count(&self) -> usize

Count total nodes in the tree.