Introduction - If you have any usage issues, please Google them yourself
Program input is a (extended) binary tree inorder sequence. For example: the first order extended binary tree sequence is ab# d## ce###. Where# null pointer. Programming to achieve binary tree as follows: 1) the establishment of binary list 2) the first order binary tree, in order, the order of traversal 3) solve the binary tree leaf node number 4) binary tree All nodes of the left and right subtree exchange