首先定義節點
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);