(a). Draw the binary tree that the following allocations create.
tnode< int > *root, *a, *c,*d, *e;
(b). List the nodes in the order of their visit for an NLR (preorder) scan.
(c). List the nodes in the order of their visit for an RLN (postorder) scan.
(d). List the nodes in the order of their visit for an LNR (inorder) scan.
a. Assuming that tnode call takes arguments like "tnode(value, left subtree, right subtree), given sequence will result in following tree.
Binary tree is drawn in ASCII mode, and is available in the text response to the question.