Collatz Compressed Binary Tree Visualization 🌳

This visualization uses a modified Collatz rule to create a perfect binary tree structure, illustrating all possible paths from a given starting number (N) down to a specific depth. **Click on any node to see its full algebraic formula.**

Start Number (N): Depth:

Click on a node in the tree to view its full algebraic expression.

Rules for this Tree:

Left Branch (N is Even): N ► N/2
Right Branch (N is Odd): N ► (3N+1)/2

The compact nodes display the path state: **n** (Odd steps), **m** (total steps), and **f** (constant term).