April 6th, 2014, 07:09 PM
Non-recursive insertion in binary search tree
I'm trying rewrite the recursive insert method for a BST into a non-recursive one. But I'm having a bit of trouble, my code doesn't seem to actually insert the new node as it keeps returning the size of the tree as 0
I was wondering if anyone can point out what's wrong?
edit: nevermind, I think I know what's wrong
Last edited by jjwooyoung; April 6th, 2014 at 07:47 PM.
Click Here to Expand Forum to Full Width
This is a CodeGuru survey question.