Depth-First Search (DFS) vs Breadth-First Search (BFS)
This post will cover the difference between the Depth–first search (DFS) and Breadth–first search (BFS) algorithm used to traverse/search tree or graph data structure.
Tag: Beginner
Linked List Implementation in Python
This post provides an overview of several methods to implement a linked list in Python.. A Linked List node consists of a data field and a reference to the next node in the list.
Graph Implementation in Python
This post implements weighted and unweighted directed graph data structure in Python using an adjacency list representation of a graph, where each vertex in the graph stores a list of neighboring vertices.
Stack Implementation in Python
This article covers the stack implementation in Python. A stack is a linear data structure that follows the LIFO (Last–In, First–Out) order, i.e., items can be inserted or removed only at one end of it.
Queue Implementation in Python
This article covers queue implementation in Python. A queue is a linear data structure that follows the FIFO (First–In, First–Out) order, i.e., the item inserted first will be the first one out.
Linked List Implementation in Java
The LinkedList class in Java is a doubly-linked list implementation of the List interface. This post provides an overview of common techniques to implement a linked list in Java programming language.
Linked List Implementation in C++
This post provides an overview of some available techniques to implement a linked list in C++ programming language.
Ternary Search vs Binary search
In this article, we will implement a ternary search algorithm and compare its performance with binary search algorithm.
C++ Implementation of Trie Data Structure
Trie is a tree-based data structure used for efficient retrieval of a key in a huge set of strings. This post covers the C++ implementation of the Trie data structure, which supports insertion, deletion, and search operations.
Trie Data Structure – Python Implementation
Trie is a tree-based data structure used for efficient retrieval of a key in a huge set of strings. In this post, we will discuss Python implementation of Trie data structure which supports insertion and search operations.
Memory Efficient C++ Implementation of Trie – Insert, Search, and Delete
This post covers memory-efficient implementation of Trie data structure in C++ using the map data structure. Trie is a tree-based data structure, which is used for efficient retrieval of a key in a large dataset of strings.
Trie Implementation in C – Insert, Search and Delete
Implement insert, search, and delete operations on Trie data structure. Assume that the input consists of only lowercase letters a–z.