// The concat method should take the Nodes from "that" // after execution, "that" should be empty. // See the tests in the main program. // // This method should create no new Nodes; // therefore it should not call pushLeft or pushRight. // Do not use a loop or a recursive definition. // public void concat (MyDeque that) { //TODO -- see comments above } // Delete should delete and return the kth element from the left. // See the tests in the main program. // // This method should create no new Nodes; // therefore it should not call pushLeft or pushRight. // You can use a loop or a recursive definition here. // public int delete (int k) { //TODO -- see comments above return 0; }