C++ 递归创建并遍历树 ** 输入1 2 0 0 3 0 0 ** #include <bits/stdc++.h> using namespace std; typedef struct Tree{ int root; Tree *left; Tree *right; }*BiTree; void dfs(BiTree &tree) { int n; cin >> n; if (n == 0) { tree = NULL; return;} tree = new Tree; tree->root = n