An AVL tree is a self-balancing binary search tree where the heights of the two child subtrees of any node differ by at most one. When this property is violated after an insertion or deletion, the ...

This repository contains a Python implementation of an Oblique Decision Tree from scratch. Unlike traditional axis-aligned decision trees that split nodes based on a single feature, an oblique ...