2016年8月17日
leetcode 173. Binary Search Tree Iterator
摘要： Implement an iterator over a binary search tree (BST). Your iterator will be initialized with the root node of a BST. Calling next() will return the n 阅读全文
posted @ 2016-08-17 23:07 冰凌花花～ 阅读(244) 评论(0) 推荐(0)
leetcode 102. Binary Tree Level Order Traversal
摘要： Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level). For example:Given binary tree [3 阅读全文
posted @ 2016-08-17 14:05 冰凌花花～ 阅读(160) 评论(0) 推荐(0)
leetcode 98. 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-08-17 11:18 冰凌花花～ 阅读(615) 评论(0) 推荐(0)