《剑指offer》55--二叉树的深度 | 平衡二叉树[C++]

最新推荐文章于 2023-01-26 11:21:48 发布

贫道绝缘子

最新推荐文章于 2023-01-26 11:21:48 发布

阅读量202

点赞数

分类专栏：剑指offer 文章标签：剑指offer 二叉树 BFS 递归 DFS

本文链接：https://blog.csdn.net/qq_15711195/article/details/97258389

版权

剑指offer 专栏收录该内容

82 篇文章 1 订阅

订阅专栏

1. 二叉树的深度

二叉树的深度_牛客题霸_牛客网【牛客题霸】收集各企业高频校招笔面试题目，配有官方题解，在线进行百度阿里腾讯网易等互联网名企笔试面试模拟考试练习,和牛人一起讨论经典试题,全面提升你的技术能力https://www.nowcoder.com/practice/435fb86331474282a3499955f0a41e8b?tpId=13&tqId=11191&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking

题目描述

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

解题思路

【C++解法】

struct TreeNode {
	int val;
	struct TreeNode *left;
	struct TreeNode *right;
	TreeNode(int x) : val(x), left(NULL), right(NULL) {}
};

1、DFS递归大法

class Solution {
public:
    int TreeDepth(TreeNode* pRoot) {
        return pRoot ? 1+max(getDepth(pRoot->left),getDepth(pRoot->right)) : 0;
    }
};

单独分离DFS：

class Solution {
public:
    int TreeDepth(TreeNode* pRoot) {
        int maxDepth = 0;
        dfs(pRoot, 0, maxDepth);
        return maxDepth;
    }

    void dfs(TreeNode* pRoot, int depth, int& maxDepth) {
        if(!pRoot ) return;
        depth += 1;
        if(depth > maxDepth) maxDepth = depth;
        dfs(pRoot->left, depth, maxDepth);
        dfs(pRoot->right, depth, maxDepth);
    }
};

2、BFS循环大法

class Solution {
public:
    int TreeDepth(TreeNode* pRoot) {
        if(!pRoot) return 0;
        queue<TreeNode*> q;
        q.push(pRoot);
        int level=0;
        while(!q.empty()){
            int len = q.size();
            level++;
            while(len--){
                TreeNode* tem = q.front(); q.pop();
                if(tem->left) q.push(tem->left);
                if(tem->right) q.push(tem->right);
            }
        }
        return level;
    }
};

【Java解法】

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */

1、DFS递归

class Solution {
    public int TreeDepth(TreeNode root) {
        return root != null
            ? Math.max(maxDepth(root.left), maxDepth(root.right)) + 1 : 0;
    }
}

单独分离DFS：

class Solution {
    public int TreeDepth(TreeNode root) {
        return dfs(root);
    }
    
    private int dfs(TreeNode root) {
        if (root == null) {return 0;}
        return Math.max(dfs(root.left), dfs(root.right)) + 1;
    }
}

2、BFS循环

import java.util.Queue;
class Solution {
    public int TreeDepth(TreeNode root) {
        if (root == null) {return 0;}
        Queue<TreeNode> q = new LinkedList<>();
        q.offer(root);
        int level = 0;
        while (!q.isEmpty()) {
            int len = q.size();
            level++;
            while (len-- > 0) {
                TreeNode p = q.poll();
                if (p.left != null) {q.offer(p.left);}
                if (p.right != null) {q.offer(p.right);}
            }
        }
        return level;
    }
}

同款LeetCode题目：

LeetCode-104. Maximum Depth of Binary Tree [C++][Java]_贫道绝缘子的博客-CSDN博客Given therootof a binary tree, returnits maximum depth.https://blog.csdn.net/qq_15711195/article/details/122390238