In →Table 1.16, M and N are two nodes in a binary tree, respectively. The number of rows i = 1, 2, 3, 4 represents four kinds of correspondence between M and N, the number of columns j = 1, 2, 3...

In →Table 1.16, M and N are two nodes in a binary tree, respectively. The number of rows i = 1, 2, 3, 4 represents four kinds of correspondence between M and N, the number of columns j = 1, 2, 3 represents the ordering between M and N in pre-order, in-order and post-order traversals, respectively. Please tick the box whenever i and j have the specified relation.

For example, if you think N is the ancestor of M, and N can be visited before M in in-order traversal, then tick the box (3, 2).