Write a program that inserts the following numbers into an initially empty BST such that the tree produced is equivalent to binary search tree. 50 30 25 75 82 28 63 70 4 43 74 Hint: Calculate the mean value in method and put that value at the root and recursively build the left and right subtree. A. Implement a function which, given a node in this binary search tree, prints out the maximum depths of its left and right subtrees. B. Implement a function to find the maximum value of all the nodes in the tree. C. Implement a function that balance the tree using appropriate rotation type and return the root value. Note: You are not allowed to use any built-in Data Structure classes to implement above scenario

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)

Rewrite the definition of the function searchNode of the class B-tree provided (bTree.h) by using a binary search. Write a C++  code to ask the user to enter a list of positive integers ending with -999, build a b- tree of order 5 using the positive integers, and display the tree contents. Also, ask the user to enter a number to search and display if the number is found in the tree. bTree.h

Write a code to implement binary search tree. Implement all the methods, find, insert, delete, minimum, max, find successor. Test out all the methods.