Non-recursive insertion in binary search tree
CodeGuru Home VC++ / MFC / C++ .NET / C# Visual Basic VB Forums Developer.com
Results 1 to 1 of 1

Thread: Non-recursive insertion in binary search tree

  1. #1
    Join Date
    Feb 2014
    Posts
    6

    Non-recursive insertion in binary search tree

    Hi,

    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?

    Code:
    edit: nevermind, I think I know what's wrong
    Last edited by jjwooyoung; April 6th, 2014 at 08:47 PM.

Posting Permissions

  • You may not post new threads
  • You may not post replies
  • You may not post attachments
  • You may not edit your posts
  •  


Windows Mobile Development Center


Click Here to Expand Forum to Full Width

This is a CodeGuru survey question.


Featured


HTML5 Development Center