📄️ AVL Tree
The AVL Tree is one of Binary Search Tree with self balance mechanism. To prevent tree become out of balance, AVL Tree detect the depth of the node and decide whether to balance or not after adding new node.
📄️ Binary Search Tree
Binary Search Tree is a tree type data structure. It start with one root node and the node can only contain two children, and we can call left hand side and right head side. In the Binary Search Tree needs follows one rule, the left hand side must be smaller than the its parent and its ancestor which if child is on its left hand side , and the right hand side should be greater than its parent and its ancestor.