Minimum Depth of Binary Tree 二叉树的最小深度
2015-03-30 20:05
417 查看
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.
/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */ //注意是叶子节点,左右都为空的节点才是 class Solution { public: int minDepth(TreeNode *root) { if(root==NULL) return 0; if(root->left==NULL && root->right==NULL) return 1; int leftDep,rightDep; leftDep=minDepth(root->left); rightDep=minDepth(root->right); if(leftDep==0) return rightDep+1; else if(rightDep==0) return leftDep+1; return (leftDep<rightDep?leftDep:rightDep)+1; } };
相关文章推荐
- [Leetcode] The minimum depth of binary tree二叉树的最小深度
- 【二叉树的递归】01二叉树的最小深度【Minimum Depth of Binary Tree】
- [LeetCode] Minimum Depth of Binary Tree 二叉树最小深度
- [LeetCode-111] Minimum Depth of Binary Tree (二叉树最小深度)
- Minimum Depth of Binary Tree 求二叉树最小高度/深度@LeetCode
- [LeetCode] Minimum Depth of Binary Tree 二叉树的最小深度
- 【LeetCode】Minimum Depth Of Binary Tree二叉树的最小深度 - Easy
- Maximum and Minimum Depth of Binary Tree 二叉树的最小最大深度 [java]
- 求二叉树的最小深度 Minimum Depth of Binary Tree
- LeetCode Minimum Depth of Binary Tree 最小深度二叉树
- lintcode minimum-depth-of-binary-tree 二叉树最小深度
- 【LeetCode-面试算法经典-Java实现】【111-Minimum Depth of Binary Tree(二叉树的最小深度)】
- Minimum Depth of Binary Tree(求二叉树的最小深度)
- LeetCode OJ:Minimum Depth of Binary Tree(二叉树的最小深度)
- Minimum Depth of Binary Tree 二叉树的最小深度
- LeetCode OJ 之 Minimum Depth of Binary Tree(二叉树的最小深度)
- LeetCode:111_Minimum Depth of Binary Tree | 二叉树的最小深度 | Easy
- 【LeetCode-面试算法经典-Java实现】【111-Minimum Depth of Binary Tree(二叉树的最小深度)】
- 【leetcode】Minimum Depth of Binary Tree 二叉树的最小深度 (JAVA)
- Minimum Depth of Binary Tree 二叉树的最小深度