Please code using Java $-$ all information is provided. Thank youLinkedPositional List $-$ Add $10$ random integers into the list, printing out each value as it is added.

Move forward through the list, staring at the first position and getting each nex

position using the list iterator, printing the element at each position. $-$ Move backward through the list using the last and before methods, printing the

element at each position.

LinkedBinaryTree

Manually creates an instance of a binary expression tree that represents the following

The element should be of type String

Create mint look something like:

Create another LinkedBinaryTree with $"9"$ as its root ele

Create a third LinkedBinaryTree with $"+"$ as its root element.

Attach the tree with the $"2"$ as the left child and the tree with the $"9"$ as the

You now have the with the

you build it$.$

is easier to build the tree in a top$-$down fashion or in a bottom$-$up fashion.

Once you have created the expression tree have your client print out the following

The literal string that represents the expression, i$.$e$.$: $\frac{(9**8)+17}{14+23}*-2$

The height of the expression tree The preOrder traversal of the tree

The inOrder traversal of the tree The postorder traversal of the tree

The breathfirst traversal of the tree

The parenthesized representation of the tree using Euler's Tour $($ section $8\mathrm{.}4\mathrm{.}6$ and Fragment $8\mathrm{.}29),$ this is NOT the parenthesize$()$ method in Code Fragment $8\mathrm{.}26.$