2016年5月3日
LeetCode OJ 95. Unique Binary Search Trees II
摘要： Given n, generate all structurally unique BST's (binary search trees) that store values 1...n. For example,Given n = 3, your program should return all 阅读全文
posted @ 2016-05-03 20:10 Black_Knight 阅读(210) 评论(0) 推荐(0)
LeetCode OJ 113. Path Sum II
摘要： Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum. For example:Given the below binary tree and sum 阅读全文
posted @ 2016-05-03 16:07 Black_Knight 阅读(218) 评论(0) 推荐(0)
LeetCode OJ 96. Unique Binary Search Trees
摘要： Given n, how many structurally unique BST's (binary search trees) that store values 1...n? For example,Given n = 3, there are a total of 5 unique BST' 阅读全文
posted @ 2016-05-03 10:28 Black_Knight 阅读(181) 评论(0) 推荐(0)
LeetCode OJ 101. Symmetric Tree
摘要： Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center). For example, this binary tree is symmetric: 1 / \ 2 2 / 阅读全文
posted @ 2016-05-03 09:46 Black_Knight 阅读(166) 评论(0) 推荐(0)