Fast AVL Trees & WAVL Trees in Java

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.

Social Networking is a smart social networking system that aims to compete with Facebook. It allows users to create profiles, add friends, search for other users, and get recommendations for new friends.

Leetcode solutions in C++ for coding interviews.

Red-Black tree (WIP)

Yet another red-black tree implementation

Text-based version of the word game "Wordle", developed in C++ and using Object Oriented Programming and the BST Data structure.

Implementation of some popular Balanced Binary Search Trees (AVL, RBT, Splay, Treap) and Performance Comparison

Comparing RB and AVL tree implementations. We Need To Go Deeper.

A Red-Black Tree Implemented in Swift

JavaScript implementation of a balanced binary search tree

A wide range of (basic) data structures, implemented in simple, readable Java.

data structures implemented in python

🎄 Red-black tree library for JavaScript

Here are the results of my attempts to implement popular data structures from scratch.

A project of Data structures and Algorithms course - 4th semester

Binary Search Tree Data Structure

This repository contains the solutions of Hacker Rank Coding Challenges I solved.

Simple Balanced BST with different traversal method

Implementation of AVL Class