Skip to content
#

avl-tree-implementations

Here are 135 public repositories matching this topic...

This is a C++ implementation of an AVL tree, which is a self-balancing binary search tree. An AVL tree maintains the balance factor of each node, which is the difference between the heights of its left and right subtrees. Whenever a node becomes unbalanced (its balance factor is either -2 or 2), the tree performs a rotation to restore the balance.

  • Updated Aug 4, 2023
  • C++

This project aims to simulate how an HFT (High-Frequency Trading) firm executes its strategies to profit through the stock exchanges. The project also simulates how a stock exchange manages its order book to match and execute orders efficiently using advanced data structures and algorithms to minimize the latency.

  • Updated Nov 29, 2024
  • Java

This repository contains practical implementation of various basic data structures in C Language. It also includes implementation of various advanced and complex data structures like AVL Trees, Red Black Trees, Huffman Coding, Binary Search Trees, Hash Tables, etc. This repository also includes various sorting algorithms like QuickSort, MergeSor…

  • Updated Aug 24, 2020
  • C

Improve this page

Add a description, image, and links to the avl-tree-implementations topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the avl-tree-implementations topic, visit your repo's landing page and select "manage topics."

Learn more