Java help. 20) For an array anda linked implementation of a queue, which of the following is correct?a.In an array implementation, dequeue() cannot be implemented in O(1) since some elements should be shifted to new locationsb. In a linked implementation, enqueue() cannot be implemented in O(1) since we need to find the end of the queue to add a new elementc. The array implementation is better thana linked implementationd. a and b are correcte. None of theabove is correct 21) Which of the following statements is true?a) The red-black tree we studied is equivalent toa 2-3 tree b) A red-black tree has the samecomplexity foradding an item asa binary search treec) In a 2-3 tree, each node can contain up to 3 valuesd) In a 2-3 tree, during an add operation, we split illegal nodes on the way down the treee) In a 2-4 tree, during an add operation, we split illegal nodes on theway down the tree16) What item is at the front of the deque after these statements are executed? DequeInterfacewaitingLine = new LinkedDeque<>(); addToBack(“Adam"); waitingLine.addToFront(“Rudy”); waitingLine.addToBack(“Larry”); waitingLine.addToBack(“Sam”); waitingLine.addtoFront(“Jack”); String name = waitingLine.getFront(); name=waitingLine.getFront(); a."Adam" b."Rudy" c. "Larry" d."Sam" e."Jack
Java help.
20) For an array anda linked implementation of a queue, which of the following is correct?
a.In an array implementation, dequeue() cannot be implemented in O(1) since some elements should be shifted to new locations
b. In a linked implementation, enqueue() cannot be implemented in O(1) since we need to find the end of the queue to add a new element
c. The array implementation is better thana linked implementation
d. a and b are correct
e. None of theabove is correct
21) Which of the following statements is true?
a) The red-black tree we studied is equivalent toa 2-3 tree
b) A red-black tree has the samecomplexity foradding an item asa binary search tree
c) In a 2-3 tree, each node can contain up to 3 values
d) In a 2-3 tree, during an add operation, we split illegal nodes on the way down the tree
e) In a 2-4 tree, during an add operation, we split illegal nodes on theway down the tree
16) What item is at the front of the deque after these statements are executed?
DequeInterfacewaitingLine = new LinkedDeque<>();
addToBack(“Adam");
waitingLine.addToFront(“Rudy”);
waitingLine.addToBack(“Larry”);
waitingLine.addToBack(“Sam”);
waitingLine.addtoFront(“Jack”);
String name = waitingLine.getFront();
name=waitingLine.getFront();
a."Adam"
b."Rudy"
c. "Larry"
d."Sam"
e."Jack
Step by step
Solved in 2 steps
