【剑指Offer】二叉树的深度

题目描述

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

示例1

• 输入

{1,2,3,4,5,#,6,#,#,7}

• 返回值

4

解题思路

• 递归

数据结构树的遍历

/**
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 leftDepth = TreeDepth(root.left);
        int rightDepth = TreeDepth(root.right);
        return Math.max(leftDepth, rightDepth) + 1;
    }
}

• 层次遍历

注意记录每一层的结点，这里时间复杂度可以降低。

ArrayList temp = new ArrayList<>();

import java.util.ArrayList;
/**
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;
        ArrayList<TreeNode> list = new ArrayList<>();
        list.add(root);
        int count = 0;
        while (!list.isEmpty()) {
            count++;
            ArrayList<TreeNode> temp = new ArrayList<>();
            for (TreeNode treeNode : list) {
                if(treeNode.left != null) temp.add(treeNode.left);
                if(treeNode.right != null) temp.add(treeNode.right);
            }
            list = temp;
        }
        return count;
    }
}

代码

/**
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 leftDepth = TreeDepth(root.left);
        int rightDepth = TreeDepth(root.right);
        return Math.max(leftDepth, rightDepth) + 1;
    }
}