1.先上代码
#include<vector>
#include <iostream>
#include <queue>
using namespace std;
struct TreeNode {
int val;
struct TreeNode *left;
struct TreeNode *right;
TreeNode(int a, TreeNode* l, TreeNode* r) {
val = a;
left = l;
right = r;
}
};
//二叉树先序遍历
void pre_order(TreeNode* tree) {
if (!tree)
return;
cout << tree->val <<