1-Write a program to implement the Binary Tree

Insert into the tree

Search for an element in the tree (If element found, just print found else print not found)

Delete nodes from the tree

Traversing through the tree (select user choice for which traversal to be performed)

PreOrder

PostOrder

InOrder

2- Write a java program named BSTree.java that will:

Generate 100 random integer numbers ranging from 1 99.

Build a Binary Search Tree using this set of numbers.

Delete 50 and 60 from the Binary Search Tree and rebuild the tree

After building the tree, display the data into three formats: prefix order, infix order and postfix order.

3- Consider a graph and write a java program that will:

Generate a minimum spanning tree using Prims algorithm and finally compute the total cost

Generate a minimum spanning tree using Kruskals algorithm and finally compute the total cost