Introduction - If you have any usage issues, please Google them yourself
The highest score for an increase in the binary tree, which traversal sequence for the given node number sequence, such as 1,2,3,4,5 ... n, obtained the highest score of the tree increases