2. ) Provide a conceptual description of the process for inserting a value at some index i of a double link linked list. Given two nodes of a double link linked list, say node si-1 and node si (where the subscript is the index of each node), how can we update the pointers of these two nodes to insert some node sk. Consider that there is a link from node si-1 to si and also a link from node si to node si-1
3. ) Recall our discussion of AVL Trees and how we can sustain O(log n) query time if we employ the AVL balancing method when inserting values at random into a given tree. Consider a collection of lists of 10 distinct random integers between 1 and 100 (where n = 10 and m = 100). Generate (2) such random lists using the BSTAlgorithm template code. First, instantiate (2) random binary search trees and then instantiate (2) AVL trees from the given random values. Draw your responses. Now generate the third list of random numbers where n = 10 and m = 100. Using the random binary search trees and AVL trees from the previous step, search for each value in the third list and specify how many comparisons are necessary to determine if each of these values is a part of the search space for all (4) trees created in the first step. Reviewing the details, make an observation about the average search time for your particular random binary search trees versus your particular AVL trees. Can you generalize your observation to be applicable to all binary search trees and AVL trees?

## Calculate the price of your order

550 words
We'll send you the first draft for approval by September 11, 2018 at 10:52 AM
Total price:
\$26
The price is based on these factors:
Number of pages
Urgency
Basic features
• Free title page and bibliography
• Unlimited revisions
• Plagiarism-free guarantee
• Money-back guarantee
On-demand options
• Writer’s samples
• Part-by-part delivery
• Overnight delivery
• Copies of used sources
Paper format
• 275 words per page
• 12 pt Arial/Times New Roman
• Double line spacing
• Any citation style (APA, MLA, Chicago/Turabian, Harvard)

# Our guarantees

Delivering a high-quality product at a reasonable price is not enough anymore.
That’s why we have developed 5 beneficial guarantees that will make your experience with our service enjoyable, easy, and safe.

### Money-back guarantee

You have to be 100% sure of the quality of your product to give a money-back guarantee. This describes us perfectly. Make sure that this guarantee is totally transparent.

### Zero-plagiarism guarantee

Each paper is composed from scratch, according to your instructions. It is then checked by our plagiarism-detection software. There is no gap where plagiarism could squeeze in.

### Free-revision policy

Thanks to our free revisions, there is no way for you to be unsatisfied. We will work on your paper until you are completely happy with the result.