Write a method to perform an NLR scan on a binary tree. Assume the method will operate on trees implemented as arrays. Provide a driver program to demonstrate that the method functions properly. Use the trees shown in Figure 7.3 as test cases.
Fig.7.3
G) (H 1B
Expert Answer
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’,’