A binary tree with the following adjacency lists is given ( B is the root ; format is: node: leftSon, rightSon): B: C, I C: D, G D: E, F E: null, null F: null, null G: H, null H: null, null I: J, L J: null, K K: null, null L: M, null M: null, null Mark the true statements:

Printing the labels in the post-order results in the sequence: EFDHGCKJMLIB

Printing the labels in the in-order results in the sequence: EDFCHGBJKIML

Printing the labels in the pre-order results in the sequence: BCDEFGHIJKLM