Suppose there is a binary tree with height 3. We perform the inorder traversal on the tree and print out the corresponding IDs of the nodes when the nodes are visited. The order of the IDs is

H, G, E, C, J, D, I, A, K, B, F

Please show the image of the binary tree.

Remark: If there are more than one binary trees which output H, G, E, C, J, D, I, A, K, B, F when performing inorder traversal, just show one such binary tree.