Given the above binary tree rooted at Node A, what is the order of nodes visited by an inorder search?
D, B, E, A, F, C, G
- A, B, C, D, E, F, G
- A, B, D, E, C, F, G
- D, E, B, F, G, C, A
- G, F, E, D, C, B, A
There are no hints for this question