Implement Stack using Singly linked list

Stack can be implemented by both array and linked list. There is some limitation or you can say that drawback in stack implementation using an array is that the array must be declared with some fixed size. In case if the size of the array becomes small to perform the required operation so this is … Read more

Dijkstra’s Algorithm Explanation with example

Dijkstra’s algorithm, given by a brilliant Dutch computer scientist and software engineer Dr. Edsger Dijkstra in 1959. Dijkstra’s algorithm is a greedy algorithm that solves the single-source shortest path problem for a directed and undirected graph that has non-negative edge weight. For Graph G = (V, E)w (u, v) β‰₯ 0 for each edge (u, … Read more

Breadth First Search (BFS) Traversal in Data Structure

Breadth-first search graph traversal techniques use a queue data structure as an auxiliary data structure to store nodes for further processing. The size of the queue will be the maximum total number of vertices in the graph. It is a smart way to look through data organized in a graph. A graph is a collection … Read more

25+ Mostly Asked Python Pattern Programs

One of the most important areas you should have a focus on when you are preparing for the interview for position of python developer, is a pattern printing program using python. I don’t think that in an interview if your recruiter is recruiting you as a software developer/software engineering profile will not ask to write … Read more

Hashing in data structure with its types

Hashing is an approach to convert a larger key into a smaller integer value within a given limited range. Here the key is a larger value that we need to store And the integer value is an address in the hash table where the key will be store. To find integer address from key-value we … Read more

Binary search tree operations with Program

There are Six operation which we can perform on Binary search Tree. Binary search tree operations Search Searches an element in a tree. Insert Inserts an element in a tree. Pre order Traversal Traverse a tree in a pre-order manner means first to traverse the Root node, then the Left node, and at last Right … Read more

Searching in Data Structure and Its type

Searching in data structures is a fundamental concept in computer science, focusing on finding an element within a data structure. This operation is crucial for numerous applications, such as database management, information retrieval, and the organization of large datasets. The efficiency of a search operation depends on the data structure used and the algorithm implemented. … Read more

Hi, Welcome back!
Forgot Password?
Don't have an account?  Register Now