AVL tree
Hey. I need your help. I need to implement algorithm of construct of AVL tree binary and randomly. (2 trees)
Both trees need to have:
* searching the smallest element and display it (searching is begginig from the root)
* deleting element which value of the key is given by users (user says how many keys he wants to remove and he give the value of keys)
* display all the elements of the tree in increasing order
*removing the whole tree , one element by one, using post-order method
*displaying value of the root
and implement the procedure of balancing the tree picking one of this method:
*balancing by removing the root
*balancing by rotation (algorithm DSW)
Please help me :(
Both trees need to have:
* searching the smallest element and display it (searching is begginig from the root)
* deleting element which value of the key is given by users (user says how many keys he wants to remove and he give the value of keys)
* display all the elements of the tree in increasing order
*removing the whole tree , one element by one, using post-order method
*displaying value of the root
and implement the procedure of balancing the tree picking one of this method:
*balancing by removing the root
*balancing by rotation (algorithm DSW)
Please help me :(
Topic archived. No new replies allowed.