Leetcode 111. Minimum Depth of Binary Tree

111. Minimum Depth of Binary Tree

• Total accepted:114343
• Total submissions:368035
• Difficulty:easy

Given a binary tree, find its minimum depth.

The minimum depth is the number of nodes along, the shortest path from the root node to the nearest leaf node.

Idea: Understand test instructions.

1. If the left and right subtree is empty, the depth of the root = Non-empty subtree depth +1

2. The left and right subtrees are not empty, the depth of the root is =min (left subtree depth, subtree depth) +1

Code:

1 /**2 * Definition for a binary tree node.3 * struct TreeNode {4 * int val;5 * TreeNode *left;6 * TreeNode *right;7 * TreeNode (int x): Val (x), left (null), right (null) {}8  * };9  */Ten classSolution { One  Public: A     intMindepth (treenode*root) { -         if(root==NULL) { -             return 0; the         } -         intLeft=mindepth (Root->left), right=mindepth (root->Right ); -         return(!left| |! right)? left+right+1: Min (left,right) +1; -     } +};

Leetcode 111. Minimum Depth of Binary Tree