{
  "node_id": "algorithm-3d6bdd918b1b4f239c725001c2d9e477",
  "keywords": [
    "leetcode",
    "二叉树的最小深度"
  ],
  "children": [],
  "export": [
    "solution.json"
  ],
  "title": "二叉树的最小深度"
}