1. Compare and contrast the Binary Search Trees (BST) featuring the balancing operation implemented with the AVL trees.;Show the advantages and disadvantages of these tree representation and processing techniques.;2. Consider an AVL tree with 9 nodes containing positive integer values in of your own from the interval 1.. 99.;a) Show the chosen tree.;b) Insert a new value in the tree. Show the tree after inserting the new value.;c) Discuss whether a rebalance operation is required or not. If yes, identify the node where the imbalance occurs, the type of imbalance and the required operation to rebalance the tree.;Note. To show the trees you can draw them using MS Word, PPT or pen, paper and scanner. Attach the document showing the required trees to your contribution.
Paper#16538 | Written in 18-Jul-2015Price : $37