charlespunk charlespunk

Be the change you wish to see in the world.

Created August 28, 2013 07:58

	Given preorder and inorder traversal of a tree, construct the binary tree.

	Note:
	You may assume that duplicates do not exist in the tree.

Created August 28, 2013 00:30

	Given inorder and postorder traversal of a tree, construct the binary tree.

	Note:
	You may assume that duplicates do not exist in the tree.

charlespunk / [LeetCode] Binary Tree Level Order Traversal II

Created August 24, 2013 01:59

	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).

	For example:
	Given binary tree {3,9,20,#,#,15,7},

	3
	/ \
	9 20
	/ \
	15 7

charlespunk / [LeetCode] Binary Tree Level Order Traversal

Created August 24, 2013 01:49

	Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level).

	For example:
	Given binary tree {3,9,20,#,#,15,7},

	3
	/ \
	9 20
	/ \
	15 7

charlespunk / [LeetCode] Convert Sorted Array to Binary Search Tree

Created August 23, 2013 17:55

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

charlespunk / [LeetCode] Convert Sorted List to Binary Search Tree

Created August 23, 2013 06:52

Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST.

charlespunk / [LeetCode] Balanced Binary Tree

Created August 23, 2013 05:34

	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 differ by more than 1.

charlespunk / [LeetCode] Minimum Depth of Binary Tree

Created August 21, 2013 05:38

	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 leaf node.

charlespunk / [LeetCode] Path Sum II

Created August 21, 2013 05:31

	Given 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 sum = 22,
	5
	/ \
	4 8
	/ / \
	11 13 4
	/ \ / \

charlespunk / [LeetCode] Path Sum

Created August 21, 2013 05:20

	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 and sum = 22,
	5
	/ \
	4 8
	/ / \
	11 13 4
	/ \ \