# Status Problem video Level Completes Likes 443 Check the completeness of given binary tree | Set 2 - Using Level Order Traversal Medium % 0 432 Breadth-First Search (BFS) in 2D Matrix/2D-Array Beginner % 1 414 Breadth-First Search in Disconnected Graph Medium % 0 413 ZigZag OR Diagonal traversal in 2d array/Matrix using queue Medium % 0 347 Find the nearest building which has bike | Find nearest specific vertex from source in a graph. Hard % 0 108 Queue with Stacks: Efficient Implementation Using Stack Operations Medium % 0 96 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. Queue with Stacks: Efficient Implementation Using Stack Operations Print The Top View of a Binary Tree 1
