实现包含二叉搜索树的每个深度的所有节点的链表

I am to solve on of the cracking the coding interview questions "Given a binary search tree, design an algorithm which creates a linked list of all the nodes at each depth (i.e., if you have a tree with depth D, you’ll have D linked lists)."I am to solve on of the cracking the coding int