**Objective:** Given a Binary tree create Linked Lists of all the nodes at each depth , say if the tree has height k then create k linked lists.

**NOTE : This problem is very similar “Print binary tree, each level in one line“**

**Input:** A binary tree

**Output: **K linked lists if the height of tree is k. Each linked list will have all the nodes of each level.

**Example:**

Read moreIn a Binary Tree, Create Linked Lists of all the nodes at each depth.