Thread Representation of A Binary Tree: Inorder Listing: Head, C, B, A, E, F, D, G, Head
Thread Representation of A Binary Tree: Inorder Listing: Head, C, B, A, E, F, D, G, Head
Thread Representation of A Binary Tree: Inorder Listing: Head, C, B, A, E, F, D, G, Head
Function INS(X)
1. P:= RPTR(X)
If RPTR(X) < 0 then
Return(P)
3. Return(P)
Searching the address of inorder predecessor of a node
with address X
Function INP(X)
1. P:= LPTR(X)
If LPTR(X) < 0 then
Return(P)
3. Return(P)
1. P:= HEAD