If the number is even divide it by 2 If the number is odd multiply it by 3 and add 1 Eventually you will reach 1. The question asks us to generate a tree that shows the complete sequence of numbers for the Collatz conjecture.We construct a non-negative integer inheritance decimal tree. The nodes on the decimal tree correspond to non-negative integers. We define Collatz-leaf nodes (corresponding to Collatz-leaf integers) on the decimal tree that satisfy the strong Collatz conjecture. We prove mathematically that Collatz-leaf nodes (Collatz-leaf integers) have inheritance characteristics. With large number and big data calculations on a computer, we conclude that all nodes at depth 800 are Collatz-leaf nodes. So we prove that the strong Collatz conjecture is true; the Collatz conjecture must also be true. For any positive integer N greater than 1, the minimum number of Collatz transform times from N to 1 is log2 N, and the maximum number of Collatz transform times is 800 *(N-1). The proposed non-negative integer inheritance decimal tree can also be used to prove other mathematical problems.