力扣111二叉树的最小深度
![在这里插入图片描述](https://img-blog.csdnimg.cn/e848aaa8dad14be7b898f126451fe865.png
* 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) return 0;
const queue = [[root,1]];
while(queue.length){
//obj就是那个大的树对象 n是记录深度的
const [obj,n] = queue.shift()
if(!obj.left && !obj.right){
return n
}
if(obj.left) queue.push([obj.left, n+1])
if(obj.right) queue.push([obj.right, n+1])
}
};