WHAT IS BINARY SEARCH TREE AND AVL TREE?

BINARY SEARCH TREE IS THAT HAVING LEFT NODE HAVING SMALLER KEY AND RIGHT SUB TREE HAVING GREATER THAN KEY
BINARY SEARCH TREE HAVING RUNNING TIME 0(N)

AVL IS NOTHING BUT BINARY SEARCH TREE HAVING AN ADDITIONAL FEATURE ,THAT HEIGHT OF CHILDREN DIFFER BY ONLY ONE ,FOR INSERTION OR DELETION FOR BALANCING SINGLE OR DOUBLE ROTATION IS NEEDED
HAVING RUNNING TIME IS EQUAL TO O(LOG N).