输入某二叉树的前序遍历和中序遍历的结果，重建二叉树。
前提假设：输入的前序遍历和中序遍历的结果中都不含重复的数字。
程序测试样例：输入前序遍历序列{1,2,4,7,3,5,6,8}和中序遍历序列{4,7,2,1,5,3,8,6}，重建二叉树并返回。# binary_tree
-
Notifications
You must be signed in to change notification settings - Fork 0
shirunqi/binary_tree
About
reConstructBinaryTree 重建二叉树
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published