感染二叉树需要的总时间
- 难度:
medium - 原始链接: https://leetcode.cn/problems/amount-of-time-for-binary-tree-to-be-infected
- 标签:
广度优先遍历,深度优先遍历
节点与其祖先之间的最大差值
- 难度:
medium - 原始链接: https://leetcode.cn/problems/maximum-difference-between-node-and-ancestor
- 标签:
深度优先遍历
有向无环图中一个节点的所有祖先
- 难度:
medium - 原始链接: https://leetcode.cn/problems/all-ancestors-of-a-node-in-a-directed-acyclic-graph
- 标签:
深度优先遍历
矩阵中移动的最大次数
- 难度:
medium - 原始链接: https://leetcode.cn/problems/maximum-number-of-moves-in-a-grid
- 标签:
深度优先遍历,广度优先遍历
2368. 受限条件下可到达节点的数目
- 难度:
medium - 原始链接: https://leetcode.cn/problems/reachable-nodes-with-restrictions
- 标签:
深度优先遍历
