Problems about binary search tree in Java.

Questions: a. Consider the following binary search tree: (Please see the figure in attached problem file) i. What tree results after you insert the nodes 44, 48, 32, 36, 38, and 49 in that order? You only need to show the final result. ii. Given the original tree, what tree results when you delete the node 43 and then node 50? (Note: there may be more than one correct answer, but please choose only one). a. If you delete an item from a binary search tree and then immediately insert it back into the tree, will you always end up with the same tree? Briefly justify your answer. b. Suppose that we have a set of unique numbers between 1 and 1000 in a binary search tree and want to ... click for more

Matlab plotting cosh and sinh on a single plot using a script file

I have no idea what I'm doing. I got help writing a Matlab program that plots the cosh(3x-(pi/2)) and sinh(5x+(pi/8)) on a single plot from x=-5 to 25 using a script file. But could you please explain to me what each line of this script file represents/does and how I actually get the graph to come up in Matlab? I especially don't understand what the i's, n's, and colons are for. Please see attachment. Thanks.

Smooth functions

PLEASE see attachment for proper display of equations. Let f be a function from N to R+ . Function f is eventually nondecreasing if such that . Function f is smooth if it is eventually nondecreasing and such that . (a) Is the function + such that a smooth function? Verify! (b) Is the function + such that = a smooth function? Verify!

Its a mathematics problem used in Algorithm

See the attach file for problem. Please read R as R+

Matlab program writing

writing program for Matlab where I find multiple roots using bisection, please see attachment