摘要： Sort List2014.1.14 23:17Sort a linked list inO(nlogn) time using constant space complexity.Solution: The first thing I thought of about this problem is merge sort. It's weakness in space complexity is perfectly avoided with linked list, as you won't need another O(n) space when merging two s 阅读全文

摘要： Insertion Sort List2014.1.14 21:58Sort a linked list using insertion sort.Solution: Everyone must've have learned about insertion sort on some data structure textbooks, like "Data Structures & Algorithm Analysis". They usually present you with source code for insertion sort on arra 阅读全文

摘要： Binary Tree Postorder Traversal2014.1.14 21:17Given a binary tree, return thepostordertraversal of its nodes' values.For example:Given binary tree{1,#,2,3}, 1 \ 2 / 3return[3,2,1].Note:Recursive solution is trivial, could you do it iteratively?Solution1: Recursive solution is trivial,... 阅读全文

摘要： Binary Tree Preorder Traversal2014.1.14 02:36Given a binary tree, return thepreordertraversal of its nodes' values.For example:Given binary tree{1,#,2,3}, 1 \ 2 / 3return[1,2,3].Note:Recursive solution is trivial, could you do it iteratively?Solution1: The recursive version of preorde... 阅读全文