当前标签：Tree

LeetCode 590. N-ary Tree Postorder Traversal

Dylan_Java_NYC 2022-06-27 05:42 阅读:56 评论:0 推荐:0

LeetCode 589. N-ary Tree Preorder Traversal

Dylan_Java_NYC 2022-06-27 05:24 阅读:69 评论:0 推荐:0

LeetCode 1120. Maximum Average Subtree

Dylan_Java_NYC 2022-06-24 16:08 阅读:83 评论:0 推荐:0

LeetCode 1676. Lowest Common Ancestor of a Binary Tree IV

Dylan_Java_NYC 2022-04-24 11:24 阅读:187 评论:0 推荐:0

LeetCode 1650. Lowest Common Ancestor of a Binary Tree III

Dylan_Java_NYC 2022-04-24 10:22 阅读:363 评论:0 推荐:0

LeetCode 1644. Lowest Common Ancestor of a Binary Tree II

Dylan_Java_NYC 2022-04-24 07:08 阅读:391 评论:0 推荐:0

LeetCode 993. Cousins in Binary Tree

Dylan_Java_NYC 2020-02-18 11:15 阅读:371 评论:0 推荐:0

LeetCode 872. Leaf-Similar Trees

Dylan_Java_NYC 2020-01-02 10:49 阅读:163 评论:0 推荐:0

LeetCode 1257. Smallest Common Region

Dylan_Java_NYC 2019-12-21 09:25 阅读:1122 评论:0 推荐:0

LeetCode 1123. Lowest Common Ancestor of Deepest Leaves

Dylan_Java_NYC 2019-12-15 10:58 阅读:440 评论:0 推荐:0

LeetCode 938. Range Sum of BST

Dylan_Java_NYC 2019-12-12 08:00 阅读:496 评论:0 推荐:0

LeetCode 987. Vertical Order Traversal of a Binary Tree

Dylan_Java_NYC 2019-12-10 07:55 阅读:947 评论:0 推荐:0

LeetCode 1110. Delete Nodes And Return Forest

Dylan_Java_NYC 2019-11-30 14:19 阅读:687 评论:0 推荐:0

LeetCode 590. N-ary Tree Postorder Traversal

Dylan_Java_NYC 2019-11-27 10:49 阅读:369 评论:0 推荐:0

LeetCode 589. N-ary Tree Preorder Traversal

Dylan_Java_NYC 2019-11-27 10:22 阅读:371 评论:0 推荐:0

LeetCode 429. N-ary Tree Level Order Traversal

Dylan_Java_NYC 2019-11-24 14:22 阅读:305 评论:0 推荐:0

LeetCode 1130. Minimum Cost Tree From Leaf Values

Dylan_Java_NYC 2019-09-04 10:54 阅读:2504 评论:0 推荐:0

LeetCode 685. Redundant Connection II

Dylan_Java_NYC 2019-07-24 12:07 阅读:368 评论:0 推荐:0

LeetCode 684. Redundant Connection

Dylan_Java_NYC 2019-07-24 11:08 阅读:267 评论:0 推荐:0

LeetCode 865. Smallest Subtree with all the Deepest Nodes

Dylan_Java_NYC 2019-07-08 13:06 阅读:405 评论:0 推荐:1