Problems

#	Status	Problem	Level	Completes	Likes
1		Check the completeness of given binary tree | Set 2 - Using Level Order Traversal	Medium	%	0
2		Breadth-First Search (BFS) in 2D Matrix/2D-Array	Beginner	%	0
3		Breadth-First Search in Disconnected Graph	Medium	%	0
4		ZigZag OR Diagonal traversal in 2d array/Matrix using queue	Medium	%	0
5		Find the nearest building which has bike | Find nearest specific vertex from source in a graph.	Hard	%	0
6		Implement Queue Using Stacks	Medium	%	0
7		Print The Top View of a Binary Tree	Medium	%	0

Check the completeness of given binary tree | Set 2 - Using Level Order Traversal

Breadth-First Search (BFS) in 2D Matrix/2D-Array

Breadth-First Search in Disconnected Graph

ZigZag OR Diagonal traversal in 2d array/Matrix using queue

Find the nearest building which has bike | Find nearest specific vertex from source in a graph.

Implement Queue Using Stacks

Print The Top View of a Binary Tree

• 1