Considering above binary tree, what will be the inorder traversal

Inorder traversal follows the left-root-right order. Starting from the root A, we first visit the left subtree of A, which is B. Then we visit A. Next, we move to the left subtree of C, which is D. Then we visit C. After that, we visit the left subtree of E, which is empty, so we visit E. Then we move to the left subtree of F, which is G. Then we visit F. Finally, we visit the right subtree of F, which is H. The correct inorder traversal is B A D C E G F H.