DFS (depth first search ) in BST (bindery search tree) in C++
DFS (depth first search) in binery search tree in C++ Code in Red highlighted area Read More
Showing posts with label Data Structure. Show all posts
Showing posts with label Data Structure. Show all posts
DFS (depth first search ) in BST (bindery search tree) in C++
DFS (depth first search) in binery search tree in C++ Code in Red highlighted area Read More
BFS (breadth first search) in BST (binary search tree)
BFS code in red color highlighted. 1) Insertion in BST 2) Normal Searching in BST. 3) BFS in BST #include<iostream.h> #inc...Read More
Graph Adjacency Matrix using 2D-Array
#include <iostream.h> #include<conio.h> void main( ) { int i, j ,siz; clrscr(); int G[100][100]; cout<<&quo...Read More
Graph Adjacency List using Link list
#include<iostream.h> #include<conio.h> struct Adj_list { int dest; struct Adj_list *next; }; struct Adjlist { struc...Read More
DFS tree in C++
#include<iostream.h> #include<conio.h> int cost[10][10],i,j,k,n; int stack[10],top,v,visit[10],visited[10]; void main() { ...Read More
Subscribe to:
Posts
(
Atom
)
