[第二轮] 3/11-3/17 CareerCup 4.4

Given a binary tree, design an algorithm which creates alinked list of all the nodes at each depth (e.g., if you have a tree with depthD, you’ll have D linked lists).

发帖规范:http://www.1point3acres.com/bbs/thread-48094-1-1.html
http://www.1point3acres.com/bbs/thread-32423-1-1.html

if array easy
if pointer bfs()

https://github.com/moophis/careercup/blob/master/4.4.cpp

典型的分层遍历
https://gist.github.com/chrislukkk/5174363

https://gist.github.com/ThunderXu/5175828
recursion, use a number to record the layer current node is in

方法： 本质上是变形的层次遍历。。。。树的坑好深 给递归跪了。。。。

https://github.com/1094401996/Ca ... t4/LinlkedTree.java

https://gist.github.com/Jnight/5279453