利用前序和中序遍历重建二叉树

#pragma once #include<vector> #include<iostream> using namespace std; struct TreeNode { int val; TreeNode *left; TreeNode *right; TreeNode(int x) : val(x), left(NULL), right(NULL)

>>阅读原文<<