摘要: 原题链接在这里:http://www.lintcode.com/en/problem/subtree/ You have two every large binary trees: T1, with millions of nodes, and T2, with hundreds of nodes. 阅读全文
posted @ 2016-02-13 23:31 Dylan_Java_NYC 阅读(173) 评论(0) 推荐(0) 编辑
摘要: 原题链接在这里:https://leetcode.com/problems/count-univalue-subtrees/ 题目: Given a binary tree, count the number of uni-value subtrees. A Uni-value subtree me 阅读全文
posted @ 2016-02-13 05:19 Dylan_Java_NYC 阅读(682) 评论(0) 推荐(0) 编辑
摘要: 原题链接在这里:https://leetcode.com/problems/largest-bst-subtree/ 题目: Given a binary tree, find the largest subtree which is a Binary Search Tree (BST), wher 阅读全文
posted @ 2016-02-13 04:50 Dylan_Java_NYC 阅读(1982) 评论(0) 推荐(0) 编辑