Binary Tree's

[Bix Beiderbecke]

Ok this question may not make much since, but here it goes: Say i'm in a Binary Tree and I come to a leaf(child, null). Now i want to replace that leaf with a node, and have the data from the leaf become the right leaf of the new node. here is some code that might make it clear:

 private void insert(Comparable data, BinaryTreeNode ans, BinaryTreeNode q)
{
if(q == null)
{
q = new BinaryTreeNode(data);
 
}
q.left = new BinaryTreeNode(ans.data);
q.right = new BinaryTreeNode(q.data);
 
} 

thanks

[Tom Hill]

hmm thats pretty vauge . Personally when I do anything with binary trees. all the nodes and leafs ARE all nodes. Drawing a little picture often helps with these sorts of things.
The idea is that a node will use references to other nodes that correspond to their children: eg:
class Node{
Node leftChild;
Node rightChild;
}
if the node has no children when its two pointers can point to null;
In general to do what you are doing:
you need the parent node to point to a new node.
and the new node point to the old 'leaf' as a right child.

Hope that helps in general.

[Elouise Kivineva]

The left and right (child) references of the newly-created node will be null, or the (static object) called "null node". The newly-created node's parent reference is ans (I presume that is a reference to your parent node).

I would do this, thinking that this method "insert" is a BinaryTree method.

private void insert(Comparable data, BinaryTreeNode ans, BinaryTreeNode q)
{
    if(q == null)
    {
        // method creates new tree node with child 
        // references initialized to null
        q = new BinaryTreeNode(data);
    }
    q.setParent( ans );
    ans.setRtChild( q ]; (or ans.setLftChild( q ]; )
}

[ August 09, 2004: Message edited by: Elouise Kivineva ]
[ August 09, 2004: Message edited by: Elouise Kivineva ]

[Dirk Schreckmann]

Moving this to the Intermediate forum...