LeetCode 111 Minimum Depth of Binary Tree BFS

阿新 • • 發佈：2022-05-28

Given a binary tree, find its minimum depth.

The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node.

Note: A leaf is a node with no children.

Solution

用 \(queue\) 將元素壓入佇列，然後每次迴圈該層的所有元素，如果該元素沒有左右子節點，則直接返回當前深度

點選檢視程式碼

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
private:
    int ans = 999999;
    queue<TreeNode*> q;
    
    
public:
    int minDepth(TreeNode* root) {
        if(!root)return 0;
        if(!root->right && !root->left)return 1;
        q.push(root);
        int cur_dep = 1;
        while(!q.empty()){
            int n = q.size();
            for(int i=0;i<n;i++){
                TreeNode *rt = q.front();
                if(rt->left)q.push(rt->left);
                if(rt->right)q.push(rt->right);
                if(!rt->right && !rt->left)return cur_dep;
                q.pop();
            }
            cur_dep+=1;
        }
        return cur_dep;
    }
};

LeetCode 111 Minimum Depth of Binary Tree BFS

Given a binary tree, find its minimum depth. The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node.

leetcode 111. Minimum Depth of Binary Tree

Given a binary tree, find its minimum depth. The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node.

LeetCode - Easy - 111. Minimum Depth of Binary Tree

技術標籤：LeetCode演算法與資料結構leetcodetreebfsdfs Topic TreeBreadth-first SearchDepth-first Search

104. Maximum Depth of Binary Tree; 111. Minimum Depth of Binary Tree; 112. Path Sum

二叉樹 Binary Tree 問題：給定層序遍歷的陣列表示二叉樹。 ⚠️ 注意：leaf節點：既無左孩子，又無右孩子

0111. Minimum Depth of Binary Tree (E)

Minimum Depth of Binary Tree (E) 題目 Given a binary tree, find its minimum depth. The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node.

LeetCode 0104 Maximum Depth of Binary Tree

原題傳送門 1. 題目描述 2. Solution 1 1、思路分析遞迴實現 1> 遞迴出口。遍歷當前結點為空，返回0。

【LeetCode】104 Maximum Depth of Binary Tree

技術標籤：leetcode演算法dfs 原題地址:https://leetcode.com/problems/maximum-depth-of-binary-tree/

[LeetCode] 662. Maximum Width of Binary Tree

Given a binary tree, write a function to get the maximum width of the given tree. The width of a tree is the maximum width among all levels. The binary tree has the same structure as afull binary tree

0104. Maximum Depth of Binary Tree (E)

Maximum Depth of Binary Tree (E) 題目 Given a binary tree, find its maximum depth. The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.

104.maximum-depth-of-binary-tree

Given a binary tree, find its maximum depth. The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.

[LeetCode 1284] Minimum Number of Flips to Convert Binary Matrix to Zero Matrix

Given am x nbinary matrixmat. In one step, you can choose one cell and flip it and all the four neighbours of itif they exist (Flip is changing 1 to 0 and 0 to 1). A pair of cells are called neighboor

662. Maximum Width of Binary Tree

0662. Maximum Width of Binary Tree (M)

Maximum Width of Binary Tree (M) 題目 Given a binary tree, write a function to get the maximum width of the given tree. The width of a tree is the maximum width among all levels. The binary tree has t

[LeetCode 1526] Minimum Number of Increments on Subarrays to Form a Target Array

Given an array of positive integerstargetand an arrayinitialof same size with all zeros. Return the minimum number of operations to form atargetarray frominitialif you are allowed to do the following

【資料結構】演算法 Maximum Width of Binary Tree 二叉樹最大寬度

目錄Maximum Width of Binary Tree 二叉樹最大寬度思路Tag Maximum Width of Binary Tree 二叉樹最大寬度

366. Find Leaves of Binary Tree

Given a binary tree, collect a tree\'s nodes as if you were doing this: Collect and remove all leaves, repeat until the tree is empty.

【刷題-LeetCode】236. Lowest Common Ancestor of a Binary Tree

Lowest Common Ancestor of a Binary Tree Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree.

[LeetCode] 958. Check Completeness of a Binary Tree 檢查二叉樹的完全性

Given a binary tree, determine if it is acomplete binary tree. Definition of a complete binary tree fromWikipedia:

leetcode 671. Second Minimum Node In a Binary Tree（二叉樹中第二大的值）

技術標籤：leetcodeleetcode演算法 Given a non-empty special binary tree consisting of nodes with the non-negative value, where each node in this tree has exactly two or zero sub-node. If the node h

【LeetCode】331. Verify Preorder Serialization of a Binary Tree 驗證二叉樹的前序序列化（Medium）（JAVA）

技術標籤：Leetcode二叉樹演算法javaleetcode資料結構【LeetCode】331. Verify Preorder Serialization of a Binary Tree 驗證二叉樹的前序序列化（Medium）（JAVA）

LeetCode 111 Minimum Depth of Binary Tree BFS

Solution

相關推薦