LintCode 242 Convert Binary Tree to Linked Lists by Depth

If you find this video helpful, please 'Like' or 'Subscribe'.
This is really helpful for the channel and also motivates me to do more of such good videos.

242 · Convert Binary Tree to Linked Lists by Depth LintCode Solved & Explained Using BFS & Queue

Link To The Problem:

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

#coding #softwareengineer #Leetcode #Algorithm #DataStructure #Java #programmer #tech #software #codinglife #Preparation
#interview #programminglife #programmingisfun #bst #binarysearchtree #leetcode #leetcode242