摘要: DescriptionGiven the root and two nodes in a Binary Tree. Find the lowest common ancestor(LCA) of the two nodes.The lowest common ancestor is the node 阅读全文
posted @ 2022-09-09 15:56 完美主义拖延症 阅读(26) 评论(0) 推荐(0)
摘要: DescriptionGiven a binary tree, find the subtree with minimum sum. Return theroot of the subtree. ExampleGiven a binary tree: 1 / \ -5 2 / \ / \0 2 -4 阅读全文
posted @ 2022-09-09 15:33 完美主义拖延症 阅读(33) 评论(0) 推荐(0)
摘要: 阅读全文
posted @ 2022-08-25 15:59 完美主义拖延症 阅读(13) 评论(0) 推荐(0)
摘要: 阅读全文
posted @ 2022-08-12 15:02 完美主义拖延症 阅读(14) 评论(0) 推荐(0)