MCPcopy Create free account
hub / github.com/aizk/algorithm-practice / levelOrder

Function levelOrder

tree/traversal/level.go:7–33  ·  view source on GitHub ↗

TODO 是否能不使用 newQueue 变量: for range 的过程中修改 slice 会怎样? 能够正常结束。循环内改变切片的长度,不影响循环次数,循环次效在循环开始前就已经确定了。

(root *TreeNode)

Source from the content-addressed store, hash-verified

source not stored for this graph (policy: none)

Callers

nothing calls this directly

Calls

no outgoing calls

Tested by

no test coverage detected