3367. 边删除后权重和的最大值
Hard | Dynamic Programming, Tree, Depth-First Search, Sorting
Tree
3372. 连接树后最大化目标节点数 I
Medium | Tree, Depth-First Search, Breadth-First Search
3373. 连接树后可到达目标节点的最大数目 II
Hard | Tree, Depth-First Search, Breadth-First Search
3425. 最长特殊路径
Hard | Array, Hash Table, Tree, Depth-First Search, Prefix Sum
3486. 最长特殊路径 II
Hard | Array, Hash Table, Tree, Depth-First Search, Prefix Sum
3544. 子树反转和
Hard | Array, Dynamic Programming, Tree, Depth-First Search
3553. 带权重子图的最小路径 II
Hard | Array, Dynamic Programming, Bit Manipulation, Tree, Depth-First Search
3558. 分配边权重的方案数 I
Medium | Math, Tree, Depth-First Search
3559. 边权重分配的方案数II
Hard | Array, Math, Dynamic Programming, Bit Manipulation, Tree, Depth-First Search
3562. 股票交易折扣的最大利润
Hard | Array, Dynamic Programming, Tree, Depth-First Search
3590. 第K小路径异或和
Hard | Array, Tree, Depth-First Search, Ordered Set
3593. 最少增量使叶子路径相等
Medium | Array, Dynamic Programming, Tree, Depth-First Search
3715. 完全平方祖先节点的和
Hard | Array, Hash Table, Math, Tree, Depth-First Search, Counting, Number Theory
3772. 树中子图的最大分数
Hard | Array, Dynamic Programming, Tree, Depth-First Search
3786. 树形分组的交互成本总和
Hard | Array, Tree, Depth-First Search
3812. 树上最小边翻转次数
Hard | Tree, Depth-First Search, Graph Theory, Topological Sort, Sorting
3820. 树中勾股距离节点
Medium | Tree, Breadth-First Search
2973. 在树节点中放置硬币的数量
Hard | Dynamic Programming, Tree, Depth-First Search, Sorting, Heap (Priority Queue)
3067. 加权树网络中可连接服务器对的数量
Medium | Array, Tree, Depth-First Search
3068. 找到节点值的最大和
Hard | Array, Dynamic Programming, Greedy, Bit Manipulation, Tree, Sorting