Hibernate4

摘要： 给出先序中序求后序；先找到根节点；#include<cstdio> #include<cmath> #include<cstdlib> #include<algorithm> using namespace std; void build_tree(int n,int *a,int *b,int *c) { int *p=b; if(n<=0) return; while(2) { if(a[0]==*p) { break; }else p++; } int t... 阅读全文