Binary Tree
文章平均质量分 63
boegkpmlkvebevwa
这个作者很懒,什么都没留下…
展开
-
[LeetCode] Unique Binary Search Trees
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 \原创 2014-04-01 16:34:48 · 410 阅读 · 0 评论 -
[LeetCode] Construct Binary Tree from Preorder and Inorder Traversal
Given preorder and inorder traversal of a tree, construct the binary tree.Note:You may assume that duplicates do not exist in the tree.原创 2014-09-04 13:32:40 · 434 阅读 · 0 评论 -
[LeetCode] Binary Tree Level Order Traversal II
Total Accepted: 9875 Total Submissions: 31987Given a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from left to right, level by level from leaf to root).原创 2014-05-08 11:05:52 · 374 阅读 · 0 评论 -
[LeetCode] Flatten Binary Tree to Linked List
Total Accepted: 10982Total Submissions: 40794My Submissions原创 2014-04-22 17:41:44 · 444 阅读 · 0 评论 -
[LeetCode] Binary Tree Level Order Traversal
Total Accepted: 12041 Total Submissions: 39526Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level).For example:Given binary原创 2014-05-08 10:29:24 · 525 阅读 · 0 评论 -
[LeetCode] Binary Tree Inorder Traversa
Total Accepted: 14158 Total Submissions: 41204原创 2014-04-08 16:51:55 · 405 阅读 · 0 评论 -
[LeetCode] Binary Tree Postorder Traversal
Total Accepted: 14158 Total Submissions: 41204Given a binary tree, return the inorder traversal of its nodes' values.For example:Given binary tree {1,#,2,3}, 1 \ 2 / 3原创 2014-04-08 16:50:16 · 431 阅读 · 0 评论 -
[LeetCode] Binary Tree Preorder Traversal
Total Accepted: 14712 Total Submissions: 42788原创 2014-04-08 16:45:41 · 364 阅读 · 0 评论 -
[LeetCode] Path Sum II
Total Accepted: 10147 Total Submissions: 37132Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum.For example:Given the below binary tree and su原创 2014-04-21 17:52:30 · 347 阅读 · 0 评论 -
[LeetCode] Minimum Depth of Binary Tree
Total Accepted: 11612 Total Submissions: 39946Given 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 le原创 2014-04-21 17:14:38 · 416 阅读 · 0 评论 -
[LeetCode] Path Sum
Total Accepted: 11233Total Submissions: 37402原创 2014-04-21 17:25:41 · 426 阅读 · 0 评论 -
[LeetCode] Populating Next Right Pointers in Each Node
Total Accepted: 12449Total Submissions: 36274My SubmissionsGiven a binary tree struct TreeLinkNode { TreeLinkNode *left; TreeLinkNode *right; TreeLinkNode *next;原创 2014-04-21 13:24:24 · 396 阅读 · 0 评论 -
[LeetCode] Populating Next Right Pointers in Each Node II
1 / \ 2 3 / \ / \ 4 5 6 7原创 2014-04-21 13:52:15 · 381 阅读 · 0 评论 -
[LeetCode] Convert Sorted Array to Binary Search Tree
Total Accepted: 10670 Total Submissions: 33573Given an array where elements are sorted in ascending order, convert it to a height balanced BST.原创 2014-04-21 10:43:55 · 465 阅读 · 0 评论 -
[LeetCode] Convert Sorted List to Binary Search Tree
Total Accepted: 9476 Total Submissions: 35578原创 2014-04-21 11:08:02 · 788 阅读 · 0 评论 -
[LeetCode] Balanced Binary Tree
Total Accepted: 13112 Total Submissions: 41069Given a binary tree, determine if it is height-balanced.For this problem, a height-balanced binary tree is defined as a binary tree in which t原创 2014-05-05 18:06:21 · 448 阅读 · 0 评论 -
[LeetCode] Unique Binary Search Trees II
Given n, generate all structurally unique BST's (binary search trees) that store values 1...n.For example,Given n = 3, your program should return all 5 unique BST's shown below. 1 3原创 2014-04-01 17:49:22 · 435 阅读 · 0 评论 -
[LeetCode] Sum Root to Leaf Numbers
Given a binary tree containing digits from 0-9 only, each root-to-leaf path could represent a number.An example is the root-to-leaf path 1->2->3 which represents the number 123.Find the total原创 2014-04-01 18:19:23 · 371 阅读 · 0 评论 -
[LeetCode] 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.原创 2014-09-04 13:23:25 · 438 阅读 · 0 评论