$1)$ first explore using the tree.java program in this week$$s learning module. This program inserts $11$ data nodes. Play around with the binary tree after these $11$ data nodes on inserted by entering the first letter as shown below.

Enter first letter of show, insert, find, delete, or traverse.

$2)$ Modify the program to insert $11$ nodes in ascending order and display the resulting Binary tree. What do you notice?

$3)$ Modify the program to insert $11$ nodes in descending order and display the resulting Binary tree. What do you notice?

$4)$ For one of the above insert steps, using the first letter for insert, to insert all the nodes.

$5)$ Create a Word document with the results $($you can take screenshots along with a few sentences about what you observed$)$ in steps $3$ & $4.$

Also take a screenshot after you played around with the program in step $1.$

Put all the group member names in this document and email to me$.$

$//$ tree.java

$//$ demonstrates binary tree

$//$ to run this program: C$>$java TreeApp

import java.io$.*$;

import java.util.$*$; $//$ for Stack class

$////////////////////////////////////////////////////////////////$

class Node

$\{$

public int iData; $//$ data item $($key$)$

public double dData; $//$ data item

public Node leftChild; $//$ this node's left child

public Node rightChild; $//$ this node's right child

public void displayNode$()//$ display ourself

$\{$

System.out.print$(\text{'}\{\text{'})$;

System.out.print$($iData$)$;

System.out.print$(",")$;

System.out.print$($dData$)$;

System.out.print$("\}")$;

$\}$

$\}//$ end class Node