the right field of node will point to node and the right field of node will contain null because it has no in-order successor two-way threading figure shows binary tree with two-way threading and its corresponding linked representation node contains null pointer in its left fieldso it will be replaced to point to node which is its in-order predecessor similarlythe left field of node will contain null because it has no in-order predecessorfigure (bbinary tree with one-way threading the left field of node will point to node the left field of node will point to node the left field of node will point to node the left field of node will contain and the left field of node will point to node figure (alinked representation of the binary tree with threading(bbinary tree with two-way threading nowlet us look at the memory representation of binary tree without threadingwith one-way threadingand with two-way threading this is illustrated in fig left data right avail root - - - - - - - - - - - - - ( figure avail root left data right - - - - - - - - ( avail root left data right - - (cmemory representation of binary trees(awithout threading(bwith one-wayand (ctwo-way threading