Skip to main content

Leetcode - 111. Minimum Depth of Binary Tree

· One min read

https://leetcode.com/problems/minimum-depth-of-binary-tree/

Solution 1​

/**
 * Definition for a binary tree node.
 * function TreeNode(val, left, right) {
 *     this.val = (val===undefined ? 0 : val)
 *     this.left = (left===undefined ? null : left)
 *     this.right = (right===undefined ? null : right)
 * }
 */
/**
 * @param {TreeNode} root
 * @return {number}
 */
var minDepth = function (root) {
  if (root === null) {
    return 0;
  }

  if (root.left === null) {
    return minDepth(root.right) + 1;
  }
  if (root.right === null) {
    return minDepth(root.left) + 1;
  }

  return 1 + Math.min(minDepth(root.left), minDepth(root.right));
};