How to determine whether or not to enter correctly according to the pre-order of the input binary tree?
I think it is based on it (former order) to build a tree, but this is a recursive, how to judge an error, will it jump out, or what? ?
Ask someone to point out ~! ! !
