Sandhya.Kishan

 Profile Answers by Sandhya.Kishan 

• Jul 16th, 2012

 

A binary tree can be traversed using only one dimensional array.

InOrder_TreeTraversal()
{
prev = null;
current = root;
next = null;

while( current != null )
{
if(prev == current.parent)
{
prev = current;
next = current.left;
}

if(next == null || prev == current.left)
{
print current.value;
prev = current;
next = cuurent.right;
}

if(next == null || prev == current.right)
{
prev = current;
next = cuurent.parent;
}

current = next;
}
}