#include <stdio.h> #include <algorithm> using namespace std; struct node{ int v,height; node *lchild; node *rchild; }; //生成一个新节点 node* newNode(int v){ node* Node = new node; Node->v = v; Node->height = 1; Node->lchild = Node->rchild = NULL; return Node; } //获取以root为根节点的子树的当前h...
