2. Give an iterative algorithm in pseudocode to visit all the nodes in a binary tree. Nodes have left and right references as well as a data field. Each time a Node is visited, your solution will print its data field. You must use a stack in your solution. Write your solution below. function iterative_inorder (Node root)

Your crazy boss has assigned you to write a linear array-based implementation of the IQueue interface for use in all the company's software. You've tried explaining why that's a bad idea with logic and math, but to no avail. So - suppress your inner turmoil and complete the add() and remove() methods of the AQueue class and identify the runtime order of each of your methods. /** A minimal queue interface */ public interface IQueue { /** Add element to the end of the queue */ public void add(E element); /** Remove and return element from the front of the queue * @returns fırst element * @throws NoSuchElementException if queue is empty */ public E remove(); /** Not an ideal Queue */ public class AQueue implements IQueue{ private El) array: private int rear; public AQueue(){ array = (E[)(new Object[10]): rear = 0: private void expandCapacity) { if (rear == array.length) { array = Arrays.copyOf(array, array.length 2): @Override public void add(E element) { / TODO @Override public E…

Write a deletion method for the AVLTree class that utilizes lazy deletion.There are several techniques you can use, but a simple one is to simplyadd a Boolean field to the Node class that signifies whether or not the nodeis marked for deletion. Your other methods must then take this field intoaccount.