$3.$ Given the binary tree with the ordering property whose nodes are, in order of insertion, $22\mathrm{.}4,16\mathrm{.}6,3\mathrm{.}2,33\mathrm{.}6,29\mathrm{.}7,19\mathrm{.}7,$ and $66\mathrm{.}1.$

a$.$ Pictorially indicate the binary tree.

b$.$ Indicate the contents of an $$in$-$order$$ traversing of the list.

c$.$ Indicate the contents of a $$pre$-$order$$ traversing of the list.

d$.$ Indicate the contents of a $$post$-$order$$ traversing of the list.

e$.$ Indicate the contents of a traversing of the list in the order R$-$L$-$C$.$