Can help in Java? Question: Using Binary search tree write a  Java program to Insert and print the element in (in-Order traversal ), then search the elements (a and z) in the tree. using the following tree:

I need to write a binary search tree in c++, without using classes; struct can be used. Inside the binary tree i need the following functions:  Insert a value Delete a value Print the values inside the tree inorder. Thank you!

In Java,What is the maximum number of comparisons that a binary search function will make when searching for a value in a 2000-elements array?  why?What is the difference between a binary tree and a binary search tree?

Write a C++ code to insert the following numbers in two Binary Search Trees. Insert numbers of first list in Binary Search Tree#1, and numbers of second list in Binary Search Tree#2. Do not insert both lists in a single Binary Search Tree.   List#1. 5, 78, 45, 23, 11, 89, 10, 78, 6, 99, 876, 5, 67, 13   List#2. 5, 89, 688, 52, 557, 953, 5, 7, 55, 35, 89, 99, 99, 6, 557, 89, 5, 99, 6, 2, 45, 12, 7, 6, 94, 93, 99, 67     After inserting numbers in Binary Search Trees. Write a function to print only those numbers that appear in List#1 and more than 2 times in List#2. For example, the number “5” appears in List#1 and 3 times in List#2. So your code should print “5” and similar other numbers.