What is the difference between AVL tree and binary search tree?

Related questions

1. Can a binary search tree ever be a max heap?
2. What is the minimum number of nodes in a binary tree?
3. What is BST tree in data structure?
4. Why do we use B tree?
5. What is heap?
6. What is the maximum height of an AVL tree with P nodes?
7. Is binary search tree sorted?
8. Is a single node a full binary tree?
9. What is rank in BST?
10. Who qualifies for HEAP?

Tags

1. #subtrees
2. #differences
3. #every
4. #because
5. #between
6. #balancing
7. #cannot
8. #right
9. #nodes
10. #above
11. #heights
12. #where
13. #search
14. #difference
15. #equal
16. #binary