Categorygithub.com/szhou12/leetcode-goleetcode0111-Minimum-Depth-of-Binary-Tree
package
0.0.0-20241220224003-b7cf03a90b2b
Repository: https://github.com/szhou12/leetcode-go.git
Documentation: pkg.go.dev
Overview
Dependencies
1
Dependents
0

# README

111. Minimum Depth of Binary Tree

Solution idea

BFS 层序遍历二叉树

Time complexity = $O(n)$ where $n$ is total number of nodes when the binary tree is actually a linked list.