Assuming that the array shown below represents a binary tree of nodes holding Integer objects, indicate which of the properties applies to the tree. More than one property may apply. It is also possible that none of the properties apply. (Draw the tree on scratch paper if it helps you to figure things out) The array: [42, 8, 3, 11, 9, 2, 13] O Complete Tree AVL Tree O Full Tree O None of the above Binary Search Tree Неар

JAVA CODE Learning Objectives: Detailed understanding of the linked list and its implementation. Practice with inorder sorting. Practice with use of Java exceptions. Practice use of generics.   You have been provided with java code for SomeList<T> class.  This code is for a general linked list implementation where the elements are not ordered.  For this assignment you will modify the code provided to create a SortedList<T> class that will maintain elements in a linked list in ascending order and allow the removal of objects from both the front and back.  You will be required to add methods for inserting an object in order (InsertInorder) and removing an object from the front or back.  You will write a test program, ListTest, that inserts 25 random integers, between 0 and 100, into the linked list resulting in an in-order list.  Your code to remove an object must include the exception NoSuchElementException.  Demonstrate your code by displaying the ordered linked list and…

PROBLEM STATEMENT: In this problem you will need to insert 5 at the frontof the provided ArrayList and return the list. import java.util.ArrayList;public class InsertElementArrayList{public static ArrayList<Integer> solution(ArrayList<Integer> list){// ↓↓↓↓ your code goes here ↓↓↓↓return new ArrayList<>(); Can you help me with this question  The Language is Java

Java -  This project will allow you to compare & contrast different 4 sorting techniques, the last of which will be up to you to select.  You will implement the following:   Bubble Sort (pair-wise) Bubble Sort (list-wise) [This is the selection sort] Merge Sort Your choice (candidates are the heap, quick, shell, cocktail, bucket, or radix sorts) [These will require independent research)   General rules: Structures can be static or dynamic You are not allowed to use built in methods that are direct or indirect requirements for this project – You cannot use ANY built in sorting functions - I/O (System.in/out *) are ok. All compare/swap/move methods must be your own. (You can use string compares) Your program will be sorting names – you need at least 100 unique names (you can use the 50 given in project #3) – read them into the program in a random fashion (i.e. not in any kind of alpha order). *The more names you have, the easier it is to see trends in speed. All sorts will be from…