我的随笔

construct-binary-tree-from-inorder-and-postorder-traversal

Adding 2016-05-23 08:59 阅读:180 评论:0 推荐:0

construct-binary-tree-from-preorder-and-inorder-traversal

Adding 2016-05-22 21:18 阅读:141 评论:0 推荐:0

Given an array where elements are sorted in ascending order, convert it to a height balanced BST.

Adding 2016-05-22 16:03 阅读:476 评论:0 推荐:0

convert-sorted-list-to-binary-search-tree

Adding 2016-05-20 22:58 阅读:136 评论:0 推荐:0

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 andsum =

Adding 2016-05-20 11:33 阅读:183 评论:0 推荐:0

Given 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 the depth of the two subtrees of every node never diffe

Adding 2016-05-20 09:47 阅读:555 评论:0 推荐:0

Given a binary tree containing digits from0-9only, each root-to-leaf path could represent a number. An example is the root-to-leaf path1->2->3which represents the number123. Find the total sum of a

Adding 2016-05-19 14:34 阅读:139 评论:0 推荐:0

A linked list is given such that each node contains an additional random pointer which could point to any node in the list or null. Return a deep copy of the list.

Adding 2016-05-19 09:27 阅读:481 评论:0 推荐:0

leetcode算法

Adding 2016-05-18 20:52 阅读:211 评论:0 推荐:0

leetcode

Adding 2016-05-18 16:32 阅读:277 评论:0 推荐:0