LeetCode Q111: 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 a binary tree node.
	* struct TreeNode {
	* int val;
	* TreeNode *left;
	* TreeNode *right;
	* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
	* };
	*/
	class Solution {
	public:
	int minDepth(TreeNode* node) {
	if(node==NULL)
	return 0;
	if(node->left==NULL&&node->right==NULL)
	return 1;
	if(node->left==NULL)
	return minDepth(node->right)+1;
	if(node->right==NULL)
	return minDepth(node->left)+1;
	if(node->left!=NULL&&node->right!=NULL)
	return min(minDepth(node->left), minDepth(node->right))+1;
	}
	};

view raw Q111MinDepthofBinaryTree.cpp hosted with ❤ by GitHub