the empty subtree considerfor examplethe binary tree shown in fig and the insertion of the name paul the result is shown in dotted lines in the same picture norma george ann nil er mary nil nil paul nil nil walter nil nil nil fig insertion in ordered binary tree the search process is formulated as recursive procedure note that its parameter is variable parameter and not value parameter this is essential because in the case of insertion new pointer value must be assigned to the variable which previously held the value nil using the input sequence of numbers that had been used above to construct the tree of fig the search and insertion procedure yields the binary tree shown in fig with call search(krootfor each key kwhere root is variable of type node fig search tree generated by preceding program procedure printtree (tnodehinteger)var iintegerbegin (*print tree with indentation *if nil then printtree( lefth+ )for : to do texts write(wtabendtexts writeint(wt key )texts writeln( )printtree( righth+ end end printtree(adens _tree *