Minimum Depth of Binary Tree

# Introduction

In this challenge, our objective is to create the `minDepth` function that finds the minimum depth of a binary tree. The minimum depth is defined as the number of nodes along the shortest path from the root node to the nearest leaf node. Our task is to develop and export the logic for this function as depicted in the image provided. Several examples are included to illustrate the expected output for various binary trees.