# 0111.Minimum-Depth-of-Binary-Tree

## Description

Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.

Note: A leaf is a node with no children.

**Example 1:** Given the below binary tree and sum = 22,

```text
      5
     / \
    4   8
   /   / \
  11  13  4
 /  \      \
7    2      1
```

**Tags:** Math, String

## 题意

> 求2数之和

## 题解

### 思路1

> 。。。。

```go

```

### 思路2

> 思路2 \`\`\`go

\`\`\`

## 结语

如果你同我一样热爱数据结构、算法、LeetCode，可以关注我 GitHub 上的 LeetCode 题解：[awesome-golang-algorithm](https://github.com/Golang-Solutions/awesome-golang-algorithm)