package
0.0.0-20241220224003-b7cf03a90b2b
Repository: https://github.com/szhou12/leetcode-go.git
Documentation: pkg.go.dev

# README

310. Minimum Height Trees

Solution idea

Topological Sort + BFS

要点总结

  1. stop 的物理意义: 剥洋葱剥到最后 剩下的 位于中央的 1 or 2 nodes.

Resource

wisdompeak/LeetCode