程序師世界是廣大編程愛好者互助、分享、學習的平台,程序師世界有你更精彩!
首頁
編程語言
C語言|JAVA編程
Python編程
網頁編程
ASP編程|PHP編程
JSP編程
數據庫知識
MYSQL數據庫|SqlServer數據庫
Oracle數據庫|DB2數據庫
 程式師世界 >> 編程語言 >> C語言 >> C++ >> C++入門知識 >> LeetCode之Minimum Depth of Binary Tree

LeetCode之Minimum Depth of Binary Tree

編輯:C++入門知識

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.

此題與Maximum Depth of Binary Tree有區別 謹慎!!!

For example,

    1
   / 
  2   

The result should be 2!!Not 1

/**
 * 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) return 0;
         if (!root->left && !root->right) return 1;
		 if (!root->left)
			 return 1 + minDepth(root->right);
		 if (!root->right)
			 return 1 + minDepth(root->left);
		 int left, right;
		 left= minDepth(root->left);
		 right = minDepth(root->right);
		 return  1 + (left < right ? left : right);
    }
};






  1. 上一頁:
  2. 下一頁:
Copyright © 程式師世界 All Rights Reserved