递归求解二叉树的深度

首先定义节点

class Node{
	int data = 0;
	Node left = null;
	Node right = null;
}

假设根节点为

Node root;

求解树的深度为

int getTreeDepth(Node node){
	if(node==null) return 0;
	int leftDepth = getTreeDepth(node.left);
	int rightDepth = getTreeDepth(node.right);
	return leftDepth>rightDepth?leftDepth+1:rightDepth+1;
}

求解为

getTreeDepth(node);