package tree;
public class GetLevelofanode {
/**
* 求二叉树某个节点所在的层数,如果没有就返回0
* @param args
*/
public static int getlevel(TreeNode root,int num,int level){
if(root==null) return 0;
if(root.value==num){
return level;
}
int l = getlevel(root.left, num, level+1);
if(l==0){
return getlevel(root.right, num, level+1);
}
return l;
}
public static void main(String[] args) {
TreeNode root = new TreeNode(3);
root.left = new TreeNode(2);
root.right = new TreeNode(5);
root.left.left = new TreeNode(1);
root.left.right = new TreeNode(4);
System.out.println(getlevel(root, 8, 1));
}
}