This repository contains selected programming assignments from the “Algorithms and Data Structures” module, completed as part of the B.Sc. in Computer Engineering at Otto von Guericke University ...

Weak AVL trees are replacements for AVL trees and red-black trees. A single insertion or deletion operation requires at most two rotations (forming a double rotation when two are needed). In contrast, ...