随笔分类 -  tree

450. Delete Node in a BST
摘要：Given a root node reference of a BST and a key, delete the node with the given key in the BST. Return the root node reference (possibly updated) of th 阅读全文
posted @ 2016-12-05 11:51 微微程序媛 阅读(209) 评论(0) 推荐(0)
297. Serialize and Deserialize Binary Tree
摘要：Serialization is the process of converting a data structure or object into a sequence of bits so that it can be stored in a file or memory buffer, or 阅读全文
posted @ 2016-11-26 13:51 微微程序媛 阅读(304) 评论(0) 推荐(0)
449. Serialize and Deserialize BST
摘要：Serialization is the process of converting a data structure or object into a sequence of bits so that it can be stored in a file or memory buffer, or 阅读全文
posted @ 2016-11-26 11:14 微微程序媛 阅读(771) 评论(0) 推荐(0)
101. Symmetric Tree
摘要：Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center). For example, this binary tree [1,2,2,3,4,4,3] is symmet 阅读全文
posted @ 2016-10-26 06:45 微微程序媛 阅读(99) 评论(0) 推荐(0)
100. 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 a 阅读全文
posted @ 2016-10-26 05:47 微微程序媛 阅读(130) 评论(0) 推荐(0)
337. House Robber III
摘要：The thief has found himself a new place for his thievery again. There is only one entrance to this area, called the "root." Besides the root, each hou 阅读全文
posted @ 2016-10-13 09:30 微微程序媛 阅读(177) 评论(0) 推荐(0)
106. Construct Binary Tree from Inorder and Postorder Traversal
摘要：Given inorder and postorder traversal of a tree, construct the binary tree. Note:You may assume that duplicates do not exist in the tree. Hide Company 阅读全文
posted @ 2016-10-13 08:16 微微程序媛 阅读(128) 评论(0) 推荐(0)
272. Closest Binary Search Tree Value II
摘要：Given a non-empty binary search tree and a target value, find k values in the BST that are closest to the target. Note: Given target value is a floati 阅读全文
posted @ 2016-10-13 06:42 微微程序媛 阅读(151) 评论(0) 推荐(0)
270. Closest Binary Search Tree Value
摘要：Given a non-empty binary search tree and a target value, find the value in the BST that is closest to the target. Note: Given target value is a floati 阅读全文
posted @ 2016-10-13 06:11 微微程序媛 阅读(124) 评论(0) 推荐(0)
111. Minimum Depth of Binary Tree
摘要：Given a binary tree, find its minimum depth. The minimum depth is the number of nodes along the shortest path from the root node down to the nearest l 阅读全文
posted @ 2016-10-12 12:24 微微程序媛 阅读(104) 评论(0) 推荐(0)
104. Maximum Depth of Binary Tree
摘要：Given a binary tree, find its maximum depth. The maximum depth is the number of nodes along the longest path from the root node down to the farthest l 阅读全文
posted @ 2016-10-12 12:06 微微程序媛 阅读(110) 评论(0) 推荐(0)
404. Sum of Left Leaves
摘要：Find the sum of all left leaves in a given binary tree. Example: 3 / \ 9 20 / \ 15 7 There are two left leaves in the binary tree, with values 9 and 1 阅读全文
posted @ 2016-10-12 11:53 微微程序媛 阅读(129) 评论(0) 推荐(0)
250. Count Univalue Subtrees
摘要：Given a binary tree, count the number of uni-value subtrees. A Uni-value subtree means all nodes of the subtree have the same value. For example:Given 阅读全文
posted @ 2016-10-12 11:52 微微程序媛 阅读(130) 评论(0) 推荐(0)
298. Binary Tree Longest Consecutive Sequence
摘要：Given a binary tree, find the length of the longest consecutive sequence path. The path refers to any sequence of nodes from some starting node to any 阅读全文
posted @ 2016-10-12 10:22 微微程序媛 阅读(140) 评论(0) 推荐(0)
114. Flatten Binary Tree to Linked List
摘要：Given a binary tree, flatten it to a linked list in-place. For example,Given 1 / \ 2 5 / \ \ 3 4 6 The flattened tree should look like: 1 \ 2 \ 3 \ 4 阅读全文
posted @ 2016-10-12 05:49 微微程序媛 阅读(111) 评论(0) 推荐(0)
255. Verify Preorder Sequence in Binary Search Tree
摘要：Given an array of numbers, verify whether it is the correct preorder traversal sequence of a binary search tree. You may assume each number in the seq 阅读全文
posted @ 2016-10-12 04:17 微微程序媛 阅读(151) 评论(0) 推荐(0)
95. Unique Binary Search Trees II
摘要：Given an integer n, generate all structurally unique BST's (binary search trees) that store values 1...n. For example,Given n = 3, your program should 阅读全文
posted @ 2016-10-11 08:37 微微程序媛 阅读(135) 评论(0) 推荐(0)
117. Populating Next Right Pointers in Each Node II
摘要：Follow up for problem "Populating Next Right Pointers in Each Node". What if the given tree could be any binary tree? Would your previous solution sti 阅读全文
posted @ 2016-10-11 08:36 微微程序媛 阅读(159) 评论(0) 推荐(0)
116. Populating Next Right Pointers in Each Node
摘要：Given a binary tree struct TreeLinkNode { TreeLinkNode *left; TreeLinkNode *right; TreeLinkNode *next; } Populate each next pointer to point to its ne 阅读全文
posted @ 2016-10-11 08:34 微微程序媛 阅读(171) 评论(0) 推荐(0)