I was going through the concepts of AVL tree and came across the definition of AVL tree from the wiki.
In computer science, an AVL tree (named after inventors Adelson-Velsky and Landis) is a self-balancing binary search tree
even most of the definition claims that AVL tree is BST, but is every AVL tree needs to be BST can't it be just BT?
In my point of view, AVL follows an algorithm that balances the Binary Tree, as BST is the subset of the binary tree, then this balancing algorithm can be applied on it.
is there anything that I am missing? Any contradictory example will be highly appreciated.