gsama的专栏

BFS from: http://leetcode.com/2010/09/printing-binary-tree-in-level-order.html public void breathFirstTraversalIterative(TreeNode root) { Queue queue = new LinkedList(); TreeNode f

Leetcode中的N queens问题是个常见题 http://www.cnblogs.com/lichen782/p/leetcode_NQueenII.html 搜到的上述博文讲的蛮清楚的 只是我渐渐搞不明白了许多需要用DFS，recursive的题目之间的关系 subset, permutation, combination,word ladder 等等