Question & Answer: mented as arrays. Provide a driver program to demonstrate that the method functions properly. Use the t…..

NLR or preorder traversal is done with trees or arrays. The binary tree can be represented as below if the root is ith element,

root:tree[root]

left child:tree[root+1]

right child:tree[root+2]

The array representation of first tree given is: tree={‘A’,’B’,’D’,’’,’E’,’F’,’’,’’,’’,’G’,’H’,’’,’’,’’,’’,’’,’’,’’,’’,’’,’’,’’,’’};

Java code:

public class NLR {
public static void main(String args[])
{

// tree to which the nlr scan to be performed is kept in an array format.
char[] tree={‘A’,’B’,’D’,’’,’E’,’F’,’’,’’,’’,’G’,’H’,’’,’’,’’,’’,’’,’’,’’,’’,’’,’’,’’,’’};
NLRScan(tree,0);
}
static void NLRScan(char[] tree,int root)
{
System.out.print(tree[root]+”,”);
if(tree[(2*root)+1]!=’’)
NLRScan(tree,(2*root)+1);
if(tree[(2*root)+2]!=’’)
NLRScan(tree,(2*root)+2);
}
}

Output:

A, B, E, G, H, D, F