LeetCode-111. Minimum Depth of Binary Tree

LeetCode-111. Minimum Depth of Binary Tree

​​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.

Example:

Given binary tree ​​[3,9,20,null,null,15,7]​​,

3 / \ 9 20 / \ 15 7

return its minimum depth = 2.

题解：注意左右子树是否非空

class Solution {public: int minDepth(TreeNode* root) { if (root == NULL){ return 0; } while (root != NULL){ if (root->left == NULL && root->right != NULL){ return minDepth(root->right) + 1; } if (root->left != NULL && root->right == NULL){ return minDepth(root->left) + 1; } return min(minDepth(root->left), minDepth(root->right)) + 1; } }};

版权声明：本文内容由网络用户投稿，版权归原作者所有，本站不拥有其著作权，亦不承担相应法律责任。如果您发现本站中有涉嫌抄袭或描述失实的内容，请联系我们jiasou666@gmail.com 处理，核实后本网站将在24小时内删除侵权内容。