# Graph Search – Depth First Search

We discussed about basic search mechanisms for Graph and Breadth First Search(BFS) in previous article. In this article we will start with basic definition of the Depth First Search(DFS). Depth First Search(DFS): In depth first search, we start from the root node then traverse the graph layerwise until we reach the leaf or dead end. In short, One […]

# Graph Search – Breadth First Search

In Our previous article about Graph, we have seen the different ways to represent the graph. we have a way to represent this unstructured data structure. Now question arise is how I will traverse through this given graph structure. There are main two methods which we will use to traverse through graph. Breadth First Search […]

# Stack Implementation Using Array

A stack is a container of objects that are inserted and removed according to the last-in first-out (LIFO) principle. A stack is a limited access data structure – elements can be added and removed from the stack only at the top. push operation adds an item to the top of the stack. pop removes the item from […]

# Graph

Graph is a non linear data structure, it contains a set of points known as nodes (or vertices) and set of links known as edges which connects the vertices. The pictorial representation is shown in the image in the left pane. Types of Graph: Undirected Graph is a graph that is a set of vertices connected by edges, where the […]

# Heap (Min/Max Heap)

What is heap? Heap is a balanced binary tree data strucure where the root-node key is compared with its children and arranged accordingly. Max Heap: Root element will always be greater than or equal to either of its child element( see the image on left pane). Min Heap: Root element will always be less than or equal […]