树的链式存储初始化及插入结点

int main() {
	BiTree root = NULL;       //定义一棵空树
	root = (BiTree)malloc(sizeof(BiTNode));//插入根结点
	root->data = { 1 };
	root->lchild = NULL;
	root->rchild = NULL;
	BiTNode* p = (BiTNode)malloc(sizeof(BiTNode));
	p->data = { 2 };
	p->lchild = NULL;
	p->rchild = NULL;
	root->lchild = p;//作为根节点的孩子
}

求树的深度

int treeDepth(BiTree T) {
	if (T == NULL)
		return 0;
	else {
		int l = treeDepth(T->lchild);
		int r = treeDepth(T->rchild);
		return l > r ? l + 1 : r + 1;
	}
}