Research Article
Novel Theorems and Algorithms Relating to the Collatz Conjecture
Algorithm 3
Inverse binary tree generation.
| (1) | Obtain integer for the current child node | | (2) | while input does not fail do | | (3) | for (int ) do | | (4) | Output | | (5) | end for | | (6) | if right parent exists for then | | (7) | Output | | (8) | for (int ) do | | (9) | Output | | (10) | if right parent exists for then | | (11) | Output | | (12) | end if | | (13) | end for | | (14) | end if | | (15) | Enter a new value for a child node | | (16) | end while |
|
