Notes on Notes -- Chapter 2, 3, 4*

chapter 2
设定dummy

----------

chapter 3

Tower of Hanoi

iterative solution

http://en.wikipedia.org/wiki/Tower_of_Hanoi
--------

chapter4

trie -- implementation
http://en.wikipedia.org/wiki/Trie

heap

priority queue

graph -- implementation
http://www.cs.bu.edu/teaching/c/graph/linked/

Dijkstra's algorithm

greedy

Check if a graph has a cycle
undirected: use DFS

directed: use Topological sorting

lowest common ancestor
http://leetcode.com/2011/07/lowest-common-ancestor-of-a-binary-tree-part-i.html

Find the immediate right neighbor of the given node, with parent links given, but without root node.( Ebay interview question)

Word Ladder II