原文链接: https://leetcode-cn.com/problems/flower-planting-with-no-adjacent
英文原文You have n gardens, labeled from 1 to n, a
标签详情
深度优先搜索 分类
原文链接: https://leetcode-cn.com/problems/insufficient-nodes-in-root-to-leaf-paths
英文原文Given the root of a binary tree an
原文链接: https://leetcode-cn.com/problems/delete-nodes-and-return-forest
英文原文Given the root of a binary tree, each node i
原文链接: https://leetcode-cn.com/problems/lowest-common-ancestor-of-deepest-leaves
英文原文Given the root of a binary tree, r
原文链接: https://leetcode-cn.com/problems/sum-of-nodes-with-even-valued-grandparent
英文原文Given the root of a binary tree,
原文链接: https://leetcode-cn.com/problems/binary-tree-coloring-game
英文原文Two players play a turn based game on a binary tr
原文链接: https://leetcode-cn.com/problems/deepest-leaves-sum
英文原文Given the root of a binary tree, return the sum of value
原文链接: https://leetcode-cn.com/problems/validate-binary-tree-nodes
英文原文You have n binary tree nodes numbered from 0 to
原文链接: https://leetcode-cn.com/problems/balance-a-binary-search-tree
英文原文Given the root of a binary search tree, return
原文链接: https://leetcode-cn.com/problems/kth-ancestor-of-a-tree-node
英文原文You are given a tree with n nodes numbered from