Fast AVL Trees & WAVL Trees in Java

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

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

Java dictionary implemented using two types of balanced binary search trees: AVL and Red-Black trees handling basic operations such as searching, insertion, deletion, batch insertion and batch deletion of items with ability to investigate properties of tree structure.