摘要：
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 @ 2017-10-12 14:43
jasminemzy
阅读(167)
评论(0)
推荐(0)
摘要：
Given the root and two nodes in a Binary Tree. Find the lowest common ancestor(LCA) of the two nodes.The lowest common ancestor is the node with large 阅读全文
posted @ 2017-10-12 12:51
jasminemzy
阅读(187)
评论(0)
推荐(0)
摘要：
Given the root and two nodes in a Binary Tree. Find the lowest common ancestor(LCA) of the two nodes. The lowest common ancestor is the node with larg 阅读全文
posted @ 2017-10-12 05:44
jasminemzy
阅读(301)
评论(0)
推荐(0)
浙公网安备 33010602011771号