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.

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

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

A Red-Black Tree Implemented in Swift

🎄 Red-black tree library for JavaScript

JavaScript implementation of a balanced binary search tree

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

Implementing Map, Set, Vector, Stack containers in c++ without the use of STL library

data structures implemented in python

Binary Search Tree Data Structure

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

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

Balanced binary search tree (BST) implementation in JavaScript, which includes functionalities like inserting, deleting, traversing nodes, and ensuring the tree remains balanced

Simple Balanced BST with different traversal method