二叉树遍历递归图解

中序遍历

void InOrder（TreeNode * bt）{
	if(bt == NULL)
		return;
	else{
		InOrder(bt->left);
		cout << bt->data;
		InOrder(bt->right);
		}
}

树的深度

int Depth(TreeNode * bt){
	if(bt==NULL){
		return 0;
	}else{
	int dep1 = Depth(bt->left);
	int dep2 = Depth(bt->right);
	return dep1:dep2?(dep1+1):(dep2+1);
	}
}