StackStalk
  • Home
  • Java
    • Java Collection
    • Spring Boot Collection
  • Python
    • Python Collection
  • C++
    • C++ Collection
    • Progamming Problems
    • Algorithms
    • Data Structures
    • Design Patterns
  • General
    • Tips and Tricks

Data Structures using C++

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.

C++ Binary Search Trees

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

Home
Follow @StackStalk
Get new posts by email:
Powered by follow.it

Popular Posts

  • Avro Producer and Consumer with Python using Confluent Kafka
    In this article, we will understand Avro a popular data serialization format in streaming data applications and develop a simple Avro Produc...
  • Monitor Spring Boot App with Micrometer and Prometheus
    Modern distributed applications typically have multiple microservices working together. Ability to monitor and manage aspects like health, m...
  • Server-Sent Events with Spring WebFlux
    In this article we will review the concepts of server-sent events and work on an example using WebFlux. Before getting into this article it ...
  • Implement caching in a Spring Boot microservice using Redis
    In this article we will explore how to use Redis as a data cache for a Spring Boot microservice using PostgreSQL as the database. Idea is to...
  • Python FastAPI microservice with Okta and OPA
    Authentication (AuthN) and Authorization (AuthZ) is a common challenge when developing microservices. In this article, we will explore how t...
  • Spring Boot with Okta and OPA
    Authentication (AuthN) and Authorization (AuthZ) is a common challenge when developing microservices. In this article, we will explore how t...
  • Getting started with Kafka in Python
    This article will provide an overview of Kafka and how to get started with Kafka in Python with a simple example. What is Kafka? ...
  • Getting started in GraphQL with Spring Boot
    In this article we will explore basic concepts on GraphQL and look at how to develop a microservice in Spring Boot with GraphQL support. ...

Copyright © StackStalk