Tags » BF's

BFS program implementation with c

bfs is one the most importat algorith techniques in the academics of btech allover india  and abroad;
we provide you the code here:
pls share with your frnds and feel free to request us more programs at prakashmishra338@gmail.com… 8 more words

Binary Tree Level Order Traversal

Given a binary tree, return the level order traversal of its nodes’ values. (ie, from left to right, level by level).

For example:
Given binary tree… 6 more words

Interview Questions

Binary Tree Zigzag Level Order Traversal

Given a binary tree, return the zigzag level order traversal of its nodes’ values. (ie, from left to right, then right to left for the next level and alternate between). 12 more words

Interview Questions

Binary Tree Level Order Traversal II

Given a binary tree, return the bottom-up level order traversal of its nodes’ values. (ie, from left to right, level by level from leaf to root). 12 more words

Interview Questions

Minimum Depth of Binary Tree

Given a binary tree, find its minimum depth.

The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node.

Interview Questions

Clone Graph, Leetcode 解题笔记

Clone an undirected graph. Each node in the graph contains a label and a list of its neighbors.

OJ’s undirected graph serialization:
Nodes are labeled uniquely. 214 more words

Leetcode

Surrounded Regions, Leetcode 解题笔记

Given a 2D board containing ‘X’ and ‘O’, capture all regions surrounded by ‘X’.

A region is captured by flipping all ‘O’s into ‘X’s in that surrounded region. 310 more words

Leetcode