A Solution of The Collatz Conjecture Problem

Research Collatz odd sequence, change (×3 + 1) ÷ 2^k operation in Collatz Conjecture to (×3 + 2^m −1) ÷ 2^k operation. Build (×3 + 2^m − 1) ÷ 2^k oddtree model and transform position model for odds in tree. Via comparing actual and virtual positions, prove if a (×3+2^m −1) ÷2^k odd sequence can not converge after infinite steps of (×3 + 2^m − 1) ÷ 2^k operation, the sequence must walk out of boundary of the tree.