使二叉树所有路径值相等的最小代价
- 难度:
medium - 原始链接: https://leetcode.cn/problems/make-costs-of-paths-equal-in-a-binary-tree
- 标签:
贪心
medium贪心medium贪心medium贪心medium贪心, 大根堆medium贪心, 深度优先遍历Update your browser to view this website correctly.&npsb;Update my browser now