2016年2月27日
Validate Binary Search Tree
摘要： Given a binary tree, determine if it is a valid binary search tree (BST). Assume a BST is defined as follows: The left subtree of a node contains only 阅读全文
posted @ 2016-02-27 21:22 sdlwlxf 阅读(135) 评论(0) 推荐(0)
Path Sum
摘要： Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum. F 阅读全文
posted @ 2016-02-27 20:40 sdlwlxf 阅读(148) 评论(0) 推荐(0)