Search:

just wrote a fast program, yep >> :)

you can cin >>x>>y>>z; too.

my bad

Cycbersnaek

I odn't think you can

cin << x << y;

have you tried seperate them?

cycbersnaek

PS: please put comments on the program. So we know what you trying to do without going thru the code.

int example(int n){
if (n==1) //must have base case to get out of recursion
return (1); // base case, when n = 1, return value 1

answer = example (n-1) * 2; ...

I think I tried that the link doesn't work.

I also found Weiss' implementation which is well commented, but he has not finished the Remove_node(i) function, I could compare only insert but that...

Hi everyone:

I am a student at University of New Mexico. For the final term project for my CS361 (CS 361 -- Data Structures and Algorithms I) I have to compare a data Structure(hash, heap, bst,...