|
摘要：
LeetCode: Binary Tree Zigzag Level Order TraversalGiven a binary tree, return the zigzag level order traversal of its nodes' values. (ie, from left to... 阅读全文
posted @ 2014-08-27 21:42
Boostable
阅读(259)
评论(0)
推荐(0)
摘要：
LeetCode: Maximum Depth of Binary TreeGiven a binary tree, find its maximum depth.The maximum depth is the number of nodes along the longest path from... 阅读全文
posted @ 2014-08-27 21:37
Boostable
阅读(157)
评论(0)
推荐(0)
摘要：
LeetCode: Construct Binary Tree from Preorder and Inorder TraversalGiven preorder and inorder traversal of a tree, construct the binary tree.Note:You ... 阅读全文
posted @ 2014-08-27 21:34
Boostable
阅读(132)
评论(0)
推荐(0)
摘要：
LeetCode: Construct Binary Tree from Inorder and Postorder TraversalGiven inorder and postorder traversal of a tree, construct the binary tree.Note:Yo... 阅读全文
posted @ 2014-08-27 21:31
Boostable
阅读(167)
评论(0)
推荐(0)
摘要：
LeetCode: Binary Tree Level Order TraversalGiven a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level ... 阅读全文
posted @ 2014-08-27 21:28
Boostable
阅读(381)
评论(0)
推荐(0)
摘要：
LeetCode: Convert Sorted Array to Binary Search TreeGiven an array where elements are sorted in ascending order, convert it to a height balanced BST.地... 阅读全文
posted @ 2014-08-27 21:19
Boostable
阅读(150)
评论(0)
推荐(0)
摘要：
LeetCode: Convert Sorted List to Binary Search TreeGiven a singly linked list where elements are sorted in ascending order, convert it to a height bal... 阅读全文
posted @ 2014-08-27 21:16
Boostable
阅读(109)
评论(0)
推荐(0)
摘要：
LeetCode: Balanced Binary TreeGiven a binary tree, determine if it is height-balanced.For this problem, a height-balanced binary tree is defined as a ... 阅读全文
posted @ 2014-08-27 21:02
Boostable
阅读(274)
评论(0)
推荐(0)
|
浙公网安备 33010602011771号