📄️ constructor
AVL represents a self balancing binary tree where the heights of the two child subtrees of any node differ by at most one. Instantiate an empty Avl tree below
📄️ search
Search for an item in the Avl tree
📄️ insert
Insert an element into the tree
📄️ delete
Delete an element from the tree
📄️ min
Find the smallest element in the tree
📄️ max
Find the largest element in the tree
📄️ successor
Finds the next biggest element after "item"
📄️ predecessor
Finds the next smallest element before "item"
📄️ rank
Finds the rank of a particular item
📄️ select
Given the rank, find the associated item
📄️ in_order
Conduct an in order traversal of the tree and output the result in a list
📄️ pre_order
Conduct a pre order traversal of the tree and output the result in a list
📄️ post_order
Conduct a post order traversal of the tree and output the result in a list
📄️ print
Prints the traversal that was made on the binary tree