leetcode tree
proudmore
这个作者很懒,什么都没留下…
展开
-
Leetcode Construct binary tree from traversal sequences
Construct Binary Tree from Preorder and Inorder TraversalGiven preorder and inorder traversal of a tree, construct the binary tree. Note: You may assume that duplicates do not exist in the tree.[code原创 2015-03-06 13:58:48 · 141 阅读 · 0 评论 -
leetcode 二叉树遍历非递归版本
pre order和in order的思路相似,通过current==null来判断是入栈还是出栈。 postorder需要记录prev和current的关系:preordrer [code]/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode le原创 2015-05-15 06:28:20 · 231 阅读 · 0 评论 -
Leetcode Binary tree right side view
Given a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you can see ordered from top to bottom.For example: Given the following binary tree, 1原创 2015-05-08 02:36:05 · 167 阅读 · 0 评论 -
Leetcode convert sorted array/list to binary search tree
Convert Sorted Array to Binary Search Tree Given an array where elements are sorted in ascending order, convert it to a height balanced BST. [code]public class Solution { public TreeNode sortedAr原创 2015-03-10 15:25:13 · 214 阅读 · 0 评论 -
Leetcode Binary 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 next smallest number in the BST.Note: next() and hasN原创 2015-03-10 16:22:54 · 188 阅读 · 0 评论 -
Leetcode 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 nodes with keys less than the node’s key. The right原创 2015-03-09 12:32:47 · 157 阅读 · 0 评论 -
Leetcode Unique binary search trees I, II
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’s. 1 3 3 2 1 \ /原创 2015-03-09 13:55:00 · 118 阅读 · 0 评论 -
Leetcode Recover binary search tree
wo elements of a binary search tree (BST) are swapped by mistake. Recover the tree without changing its structure. Constant extra space. [code]public class Solution { TreeNode node1, node2, prev原创 2015-03-09 12:44:45 · 172 阅读 · 0 评论 -
Leetcode Tree 基础题
Same tree Given two binary trees, write a function to check if they are equal or not. Two binary trees are considered equal if they are structurally identical and the nodes have the same value.public原创 2015-03-06 14:35:48 · 228 阅读 · 0 评论 -
Leetcode Bianry tree upside down
Given a binary tree where all the right nodes are either leaf nodes with a sibling (a left node that shares the same parent node) or empty, flip it upside down and turn it into a tree where the origi原创 2015-03-07 06:24:17 · 129 阅读 · 0 评论 -
Leetcode Populating next right pointers in each node II
Given the following binary tree, 1 / \ 2 3 / \ \ 4 5 7After calling your function, the tree should look like: 1 -> NULL / \ 2 -> 3 -> NUL原创 2015-03-07 08:08:27 · 122 阅读 · 0 评论 -
Leetcode 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 / \ / \3 4 4 3But the following is not:原创 2015-03-06 13:12:06 · 205 阅读 · 0 评论 -
Leetcode 二叉树遍历
[code] in orderpublic class Solution { List<Integer> list=new ArrayList<Integer>(); public List<Integer> inorderTraversal(TreeNode node) { if(node==null)return list; inorderTr原创 2015-03-06 08:05:06 · 126 阅读 · 0 评论 -
Leetcode Path sum I, II
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.For example: Given the below binary tree and sum = 2原创 2015-03-07 07:04:40 · 143 阅读 · 0 评论 -
Leetcode Count complete tree node
Given a complete binary tree, count the number of nodes.Definition of a complete binary tree from Wikipedia: In a complete binary tree every level, except possibly the last, is completely filled, and原创 2015-06-07 02:59:28 · 170 阅读 · 0 评论