Can help in Java?? Using Binary search tree write a Java program to Insert the elements from user and print the element in (in-Order traversal ), then search the elements (a and z) in the tree

C programming help   get numbers from user using a struct that points(pointer) into a binary search tree and another pointer into a array to use merge sort on the array then prints out all the numbers and at what hight they are in the binary tree and also prints out the sorted array

Java Code: How to implement logic for ParseBlock and ParseContinue/Break where all of the Node data structure correct, parses correctly, throws exceptions with good error messages. Make sure to write block of codes for these two methods.

Find out how well the stack functions when it is allowed to be itself.