a) Show the BST that is created by inserting the following numbers in the given order 80, 100, 40, 105, 90, 30, 20, 35, 38, 32,25, 10 b) Delete 40 from the tree c) Give the PreOrder Traversal of the tree in (a) d) Give the PostOrder Traversal of the tree in (a) e) What is the runtime of PostOrder Traversal of the tree in (a)?

Given the following tree, calculate the postorder traversal order of its e lements. F A В D E

Write code to traverse a binary tree in preorder and postorder. You may use my tree code as a starting point. The tree should contain at least eight nodes. You may hardcode the initialization into your program like I showed in class. Set up your tree in the program by calling setTree(---) like I did in my code. After calling your two traversals, call my inorder Traverse() method to verify that your methods print (effectively!) the same tree. I changed the inOrder Traverse () method to be private, as I mentioned in class. Note: When demonstrating the program, first turn in a hand-drawn picture of your tree. Data fields are: Title of book

The purpose of this assignment is to practice (JAVA): Implement a binary search tree structure Demonstrate tree traversals Analyze and compare algorithms for efficiency using Big-O notation For this project, you will implement a binary search tree and use it to store a large text file (JAVA). Your program should read text from a file and insert each word in a binary search tree. Do not store duplicate text. Once the tree is populated, print the contents of the tree using an in-order traversal. Next, allow the user to enter words to search for. For each word entered, your program should report the number of elements inspected and whether or not the word was located. Next, allow the user to enter words to remove from the tree. After each removal, print the contents of the tree. Provide an analysis of your remove and search algorithms using Big-O notation. Be sure to provide justification for your claims. (Look at image attached for sample run)