Suppose the in-order and post-order traversal sequences of a binary tree are, respectively, G L D H B E I A C J F K and L G H D I E B J K F C A, complete the following operations: (1) Draw the...

Suppose the in-order and post-order traversal sequences of a binary tree are, respectively, G L D H B E I A C J F K and L G H D I E B J K F C A, complete the following operations:

(1) Draw the illustration of the logical structure of the binary tree.

(2) Draw the in-order threaded binary tree of the question above.

(3) Draw the illustration of the linked storage structure of in-order threaded binary tree, and use C language to represent it.

(4) Give the algorithm which uses in-order thread to obtain the in-order successor of a node.