I think the right order would be A,B,C,D,E,F,H,I,J,G,K,L. As H doesn't have any left child, H would be printed first and then comes I and J because the in-order goes Left Data Right. Correct me if I'm wrong.
For further actions, you may consider blocking this person and/or reporting abuse
We're a place where coders share, stay up-to-date and grow their careers.
I think the tree you show has a mistake when you did the in-order depth search the tree should be like this graph.
Or the order wouldn't be A,B,C,D,E,F,G,H,I,J,K,L.
From the way you graphed it...
The in-order result would be A,B,C,D,E,F,I,J,H,G,K,L.
I think the right order would be A,B,C,D,E,F,H,I,J,G,K,L. As H doesn't have any left child, H would be printed first and then comes I and J because the in-order goes Left Data Right. Correct me if I'm wrong.