CodeGuru Home VC++ / MFC / C++ .NET / C# Visual Basic VB Forums Developer.com
Results 1 to 6 of 6

Thread: Binary Trees

  1. #1
    Join Date
    Oct 2009
    Posts
    2

    Binary Trees

    well this may not actually be called a binary tree. but i need a tree that would insert a new element as a children of last element inserted.
    I am only inserting 0's and 1's
    0's to the left and 1's to the right.

    Eg: Inserting 1,0,1,1,0 would give:


    ......................1
    ...................../..\
    ....................0...null
    .................../..\
    ..............null....1
    ...................../..\
    ................null.....1
    ......................../..\
    ......................0.....null

    That means it would create a new level every time i insert an element.

    this is what i've thought so far. but it doesnt seem to work.
    Please help?

    void insert(node *&tree, int ele)
    {
    if(tree==NULL)
    {
    tree = new node(ele);
    if (flag == 1)
    {
    cout<<"\nleft insert: made it the root.\n";
    tree = tree->left;
    }
    else if (flag == 2 )
    {
    cout<<"\nright insert: made it the root.\n";
    tree = tree->right;
    }
    flag = 0;
    tree_level++;
    return;
    }
    else if (ele == 0 ) // (ele <= tree -> data)<--for a "decimal" binary tree.
    { flag = 1;//tree = tree->left;
    insert(tree->left, ele);
    }
    else //if ele == 1, the only other possible binary value.
    {
    flag = 2;//tree = tree->right;
    insert(tree->right,ele);
    }
    return;
    }

  2. #2
    Join Date
    Jul 2002
    Posts
    2,543

    Re: Binary Trees

    According to your requirement, you can replace this tree by linked list.

  3. #3
    Join Date
    Jun 2009
    Location
    France
    Posts
    2,513

    Re: Binary Trees

    1 - We need to know what your "node" looks like. I'd be ready to place money there is a problem there. And if there isn't, it would really help to see it.

    2 -
    Code:
    tree = tree->left;
    This probably isn't doing what you think it is. That, or you have a strange way of thinking

  4. #4
    Join Date
    Jun 2009
    Location
    France
    Posts
    2,513

    Re: Binary Trees

    May I recommend this article?

    http://www.eternallyconfuzzled.com/t..._tut_bst1.aspx

    It is quite text heavy, but it is intelligently written. The author holds your hand while writing an implementation of the binary search tree. Learn, inspire and adapt.

  5. #5
    Join Date
    Feb 2002
    Posts
    4,640

    Re: Binary Trees

    I agree with Alex. If you're only ever inserting '1' and '0', you're actually building a linked list, not a tree.

    Viggy

  6. #6
    Join Date
    May 2009
    Posts
    2,413

    Re: Binary Trees

    Quote Originally Posted by Alex F View Post
    According to your requirement, you can replace this tree by linked list.
    Or rather you can build this tree sequentially.

Posting Permissions

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





Click Here to Expand Forum to Full Width

Featured