2016年3月2日
LeetCode -- Construct Binary Tree from Preorder and Inorder
摘要： Question: Given preorder and inorder traversal of a tree, construct the binary tree. Note:You may assume that duplicates do not exist in the tree. Ana 阅读全文
posted @ 2016-03-02 17:26 江湖小妞 阅读(311) 评论(0) 推荐(0) 编辑
LeetCode -- Validate Binary Search Tree
摘要： Question: 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 con 阅读全文
posted @ 2016-03-02 14:02 江湖小妞 阅读(225) 评论(0) 推荐(0) 编辑
LeetCode -- Binary Tree Inorder Traversal
摘要： Question: Given a binary tree, return the inorder traversal of its nodes' values. For example:Given binary tree {1,#,2,3}, 1 \ 2 / 3 return [1,3,2]. N 阅读全文
posted @ 2016-03-02 09:30 江湖小妞 阅读(199) 评论(0) 推荐(0) 编辑