Design the binary tree that the following allocations create.
tnode< int > *root, *a, *c,*d, *e;
e = new tnode< int > (50);
d = new tnode< int > (20, NULL, e);
c = new tnode< int > (30);
b = new tnode< int > (45, c, NULL);
a = new tnode< int > (15, b, d);
root = new tnode< int > (10, NULL, a);
(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.