Cracking The Coding Interview/Q 4.4

From Software Engineers Wiki
Jump to: navigation, search

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).

Answer

Please refer to Create a linked list of nodes in each depth page.

Personal tools
Namespaces

Variants
Actions
Navigation
Toolbox