well, i need some ideals from yours.
anyone who have ideals on the breadth-frist binary search tree by recursion technique. i can't mix the code with other function, such as bin search, depth-first search and others. i would prefer some advises and ideals (how to pointer move, what things should do.... ), i need not to have the source code. i wan have a try. pls ... thanks guys.