Data Structures enable managing of large amounts of data efficiently both in terms of memory and speed. These tutorials provide sample implementations of commonly used data structures using C++.
C++ Stacks
Stack is a last-in, first-out (LIFO) data structure. i.e. the element added last to the stack will be the one to be removed first. This article explains the basics of stack and provides an implementation using arrays and linked lists.
C++ Queues
Queue is a first-in, first-out (FIFO) data structure. i.e. the element added first to the queue will be the one to be removed first. This article explains the basics of queue and provides an implementation using C++.
C++ Singly Linked Lists
Linked lists are building blocks for many other data structures like stacks and queues. This article explains the concept of singly linked lists and provides a sample implementation in C++.
C++ Deque
Deque is an abbreviation for double-ended queue. It is a data structure in which the elements can be added or removed from both front and back of the queue.
This article explains the concept of binary search trees (BST) and provides a sample implementation using C++.
C++ DFS Traversal methods of Trees
This article explains the depth first search (DFS) traversal methods for binary search search trees. Pre-Order, In-Order and Post-Order are depth first search traversal methods for binary search trees.
C++ Level Order Traversal of Trees
This article explains level-order traversal Breadth First (BFS) traversal of binary search tree with a sample implementation in C++.
C++ Heaps
Heap is a binary tree that stores priorities (or priority-element pairs) at the nodes. This article explains the heap data structure and provides a sample implementation using C++.
C++ Tries
Tries are used to index and search strings in a text. This article explains the Trie data structure and provides a sample implementation in C++.
0 comments:
Post a Comment