递归建立二叉树并且递归遍历它

#include <iostream> #include<bits/stdc++.h> using namespace std; typedef struct node{ int data; struct node *lchild,*rchild; }treenode; int cretree(treenode* &root){ int x; cin>>x;     if(x==0) root=N

>>阅读原文<<