Implementation of various types of trees in data structures
In competitive programming, Segment trees, Decart trees, Fenwick trees, AVL trees, and many more other types of trees are extremely useful. In this repository, many of them will be mentioned and several resources will be provided. We do our utmost in order to improve code quality and structures.