The following sequence of numbers will be inserted into a tree data structure: 500, 250, 750, 1000, 2000, 25, 1, 2, 50, 249, 3000, 900, 875, 880, 800, 200, 600 Answer the following questions: What will the binary search tree look like after the numbers are inserted in the given order? From the tree you finished in 1), what will the tree look like each time after the following numbers are deleted (use the delete algorithm discussed in class where the successor is found in the right child subtree): Delete(3000) Delete(50) Delete(750) From the tree you finished in 2), what will the preorder and postorder traversals look like?
Any one help me the following questions
The following sequence of numbers will be inserted into a tree data structure:
500, 250, 750, 1000, 2000, 25, 1, 2, 50, 249, 3000, 900, 875, 880, 800, 200, 600
Answer the following questions:
- What will the binary search tree look like after the numbers are inserted in the given order?
- From the tree you finished in 1), what will the tree look like each time after the following numbers are deleted (use the delete
algorithm discussed in class where the successor is found in the right child subtree):- Delete(3000)
- Delete(50)
- Delete(750)
- From the tree you finished in 2), what will the preorder and postorder traversals look like?
Given the same sequence of numbers:
500, 250, 750, 1000, 2000, 25, 1, 2, 50, 249, 3000, 900, 875, 880, 800, 200, 600
Show the iterations of the following sorting algorithms applied this set:
- Insertion
- Selection
- Quicksort (circle the pivot number each time the partition function is called)
Code Review Section
Your co-worker has developed a function to find the median value in an unsorted array with an odd number of elements. For arrays with an even number of elements, this function does not apply.
To normally find such a value would be to sort the array and then obtain the value at the middle index of the array. For example, [5 2 53 1 4], the median is 4 because when it is sorted, the array will be [1 2 4 5 53] and the value at the middle index is 4.
Your co-worker’s function uses the partition function that is the same function as the one the QuickSort algorithm uses. Here’s the code he shows you:
public static int[] array = {6, 1, 20, 10, 4};
public static int findMedian(int lo, int hi, int medianIndex)
{
int partitionIndex = partition(lo, hi);
if (medianIndex == partitionIndex)
return partitionIndex;
if (medianIndex > partitionIndex)
return findMedian(partitionIndex + 1, hi, medianIndex);
else
return findMedian(lo, partitionIndex - 1, medianIndex);
}
public static void main (String args[])
{
System.out.println(findMedian(0, 4, 2));
}
Upon reviewing the code, you find there is an error with it. Show your analysis by including the following:
- Show what the current code will print on the screen and explain why it is wrong
- Show the update(s) to the code you would make to fix the problem
A co-worker emails you and said she developed a recursive version for doing search in a binary search tree. Here’s the code for the function:
public boolean searchRecursive(Node current, int searchValue)
{
if (current == null)
return false;
if (current.data == searchValue)
return true;
else if (current.data > searchValue)
return searchRecursive(current.right, searchValue);
else
return searchRecursive(current.left, searchValue);
}
She’s not sure if there is an error or not because the code does compile. You analyze the code and respond to her as follows:
- Draw a picture of what a binary search tree would look like after inserting values of 10, 15, 18, 13, 5, 1, and 8 in that order
- Next, if you believe there is no error with the code, then show her how the code executes when searching for different values using the tree you made in step 1)
- Or, if you believe there is an error with the code, then show her how the code executes when searching for different values using the tree you made in step 1). In addition, show her the code fix(es) that should be made to get it to work
Trending now
This is a popular solution!
Step by step
Solved in 5 steps with 2 images
