Code from Problem Solving with Algorithms and Data Structures using Python

C++ implementation of an AVL tree template.

Fast AVL Trees & WAVL Trees in Java

School project: reimplement the STL containers (using allocator, double linked list and AVL binary trees).

Generic single-file implementations of AVL tree in C and C++ suitable for deeply embedded systems. There is little activity because the project is finished.

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.

Your one-stop GitHub repo for competitive coding and data structures! 🤖 Curated notes, practice problems, and real-world applications. Sharpen your skills and ace those interviews! 💻🔥

DataStructure Course Project, 2021/1400, Spring CSE & IT Dept., Shiraz University

Simple AVL Tree with WebPage which shows deepth- Nodes with a visual interface

data structures and algorithms implemented in Python

A header-only order-statistic AVL tree

My implementations of Basic to Advanced data structures and Algorithms in python

A full reimplementation of the C++ famous STL containers (Vector, Map and Stack)

♨️ Data structures, algorithms and problem solving patterns using JavaScript.

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.

Efficient Implementation of Binary Search Tree & AVL Binary Tree

AVL tree: height-balanced trees in C supporting add, remove, search, update features. A comparison of AVL trees with red-black trees is also done(std::set).

AVL tree implementation