[Leetcode] Minimum Depth of Binary Tree

最新推荐文章于 2023-12-15 03:22:29 发布

转载最新推荐文章于 2023-12-15 03:22:29 发布 · 90 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/yanhewu/p/8409008.html

Minimum Depth of Binary Tree 题解

题目来源：https://leetcode.com/problems/minimum-depth-of-binary-tree/description/

Description

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.

Solution

class Solution {
private:
    struct Task {
        TreeNode *node;
        int depth;
        Task(TreeNode *n, int d) : node(n), depth(d) {}
    };
public:
    int minDepth(TreeNode* root) {
        if (!root) {
            return 0;
        }
        queue<Task> q;
        q.push(Task(root, 1));
        while (!q.empty()) {
            Task task = q.front();
            q.pop();
            TreeNode *node = task.node;
            if (node -> left == NULL && node -> right == NULL) {
                return task.depth;
            }
            if (node -> left)
                q.push(Task(node -> left, task.depth + 1));
            if (node -> right)
                q.push(Task(node -> right, task.depth + 1));
        }
    }
};