Binary Trees

[panaz]

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;
}

[Alex F]

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

[monarch_dodra]

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 -

tree = tree->left;

This probably isn't doing what you think it is. That, or you have a strange way of thinking

[monarch_dodra]

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.

[MrViggy]

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

Viggy

[nuzzle]

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

Or rather you can build this tree sequentially.