hello friends,
I am stuck at some problems,here are these:
1)Write a program in 'c' language to merge the contents of two binary
search trees into one
.Also, calculate the time and space complexities of your program?
2) Write c++ program to creat functions that calculate the value of
x^n.
Assume that X=|=0, n=|=0.
Thanks.
Harshal.
