算法题目-二叉树的深度

二叉树的深度

思路：如果一棵树，既有右子树又有左子树，该树的深度就是其左右子树深度的较大值再加1

解答：

/**public class TreeNode {    int val = 0;    TreeNode left = null;    TreeNode right = null;    public TreeNode(int val) {        this.val = val;    }}*/public class Solution {    public int TreeDepth(TreeNode root) {        if(root==null){            return 0;        }        int left=TreeDepth(root.left);        int right=TreeDepth(root.right);        return (left>right)?left+1:right+1;    }}