AVL Trees
	• The main question you should be facing with an AVL tree is – whether or not such restructuring is always necessary – binary search trees are used to insert, retrieve, and delete elements quickly and the speed of performing these operations i the issue, not the shape of the tree – performance can be improved by balancing the tree but luckily this is not the only method available