jdflyfly

2014年7月3日

摘要： Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum. 阅读全文

posted @ 2014-07-03 00:03 jdflyfly 阅读(231) 评论(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. 阅读全文

posted @ 2014-07-03 00:00 jdflyfly 阅读(204) 评论(0) 推荐(0) 编辑

2014年7月2日

[leetcode] Minimum Depth of Binary Tree

摘要： Given a binary tree, find its minimum depth. 阅读全文

posted @ 2014-07-02 23:58 jdflyfly 阅读(223) 评论(0) 推荐(0) 编辑

[leetcode] Balanced Binary Tree

摘要： Given a binary tree, determine if it is height-balanced. 阅读全文

posted @ 2014-07-02 23:55 jdflyfly 阅读(263) 评论(0) 推荐(0) 编辑

[leetcode] Convert Sorted List to Binary Search Tree

摘要： Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST. 阅读全文

posted @ 2014-07-02 23:48 jdflyfly 阅读(162) 评论(0) 推荐(0) 编辑

[leetcode] Convert Sorted Array to Binary Search Tree

摘要： Given an array where elements are sorted in ascending order, convert it to a height balanced BST. 阅读全文

posted @ 2014-07-02 23:40 jdflyfly 阅读(124) 评论(0) 推荐(0) 编辑

[leetcode] Binary Tree Level Order Traversal II

摘要： Given 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). 阅读全文

posted @ 2014-07-02 23:37 jdflyfly 阅读(133) 评论(0) 推荐(0) 编辑

[leetcode] Construct Binary Tree from Preorder and Inorder Traversal

摘要： Given preorder and inorder traversal of a tree, construct the binary tree. 阅读全文

posted @ 2014-07-02 23:33 jdflyfly 阅读(121) 评论(0) 推荐(0) 编辑

[leetcode] Construct Binary Tree from Inorder and Postorder Traversal

摘要： Given inorder and postorder traversal of a tree, construct the binary tree. 阅读全文

posted @ 2014-07-02 23:05 jdflyfly 阅读(195) 评论(0) 推荐(0) 编辑

[leetcode] Maximum Depth of Binary Tree

摘要： Given a binary tree, find its maximum depth. 阅读全文

posted @ 2014-07-02 23:02 jdflyfly 阅读(113) 评论(0) 推荐(0) 编辑

公告