tree
Opium_Z
这个作者很懒,什么都没留下…
展开
-
Leetcode 652 Find Duplicate Subtrees
Problem: Given a binary tree, return all duplicate subtrees. For each kind of duplicate subtrees, you only need to return the root node of any one of them. Two trees are duplicate if they have the sam...原创 2019-04-04 08:36:37 · 121 阅读 · 0 评论 -
Leetcode 450 Delete Node in a BST
Problem: Given a root node reference of a BST and a key, delete the node with the given key in the BST. Return the root node reference (possibly updated) of the BST. Basically, the deletion can be div...原创 2019-04-04 09:50:22 · 109 阅读 · 0 评论