xiaofang3a的专栏

#include using namespace std; #define Maxn 1010 class heapClass { private: int heap[Maxn],len; public: heapClass():len(0) { } bool isempty(); void push(int x); int pop(); }; void heapClass::p

#include using namespace std; //二叉搜索树左儿子的值比当前节点小，右儿子的数值比当前节点大 struct node { int val; node *lchd,*rchd; }; //创建树 node *insert(node *p,int x) { if(p==NULL) { node* q=new node; q->val=x; q->lch