Java 实现二叉树的深度

输入一棵二叉树，求该树的深度。从根结点到叶结点依次经过的结点（含根、叶结点）形成树的一条路径，最长路径的长度为树的深度。

代码

解法一

    static class TreeNode {
        int val;
        TreeNode left;
        TreeNode right;

        public TreeNode(int val) {
            this.val = val;
        }
    }

    /**
     * 递归求深度
     * @param root
     * @return
     */
    public static int treeDepth(TreeNode root) {
        if (root == null) {
            return 0;
        }
        // 计算左子树的深度
        int left = treeDepth(root.left);
        // 计算右子树的深度
        int right = treeDepth(root.right);
        // 树root的深度=路径最长的子树深度 + 1
        return left >= right ? (left + 1) : (right + 1);
    }

解法二

public int treeDepth2(TreeNode root) {
        if (root == null) {
            return 0;
        }
        int depth = 0;
        Stack<TreeNode> stack = new Stack<>();
        stack.push(root);
        while (!root.isEmpty()) {
            depth++;
            int size = stack.size();
            while (size > 0) {
                TreeNode current = stack.pop();
                if (current.right != null) {
                    stack.push(current.right);
                }
                if (current.left != null) {
                    stack.push(current.left);
                }
                size--;
            }
        }
        return depth;
    }