2018 年 6月 13 日随笔档案 - 程序媛詹妮弗

2018年6月13日

[leetcode]99. Recover Binary Search Tree恢复二叉搜索树

摘要： Two elements of a binary search tree (BST) are swapped by mistake. Recover the tree without changing its structure. Example 1: Example 2: Follow up: A 阅读全文

posted @ 2018-06-13 02:58 程序媛詹妮弗阅读(102) 评论(0) 推荐(0) 编辑

[leetcode]333. Largest BST Subtree最大二叉搜索树子树

摘要： Given a binary tree, find the largest subtree which is a Binary Search Tree (BST), where largest means subtree with largest number of nodes in it. Not 阅读全文

posted @ 2018-06-13 02:52 程序媛詹妮弗阅读(148) 评论(0) 推荐(0) 编辑