Final answer:
In a binary tree, the nodes visited in in-order, pre-order, and post-order traversals can be determined. Additionally, the height of a binary tree can be calculated.
Step-by-step explanation:
An in-order traversal visits the left subtree, then the root, and finally the right subtree. In the given binary tree, the nodes visited in in-order traversal would be: D, B, E, A, F, C, G.
A pre-order traversal visits the root, then the left subtree, and finally the right subtree. In the given binary tree, the nodes visited in pre-order traversal would be: A, B, D, E, C, F, G.
A post-order traversal visits the left subtree, then the right subtree, and finally the root. In the given binary tree, the nodes visited in post-order traversal would be: D, E, B, F, G, C, A.
The height of a binary tree is the number of edges in the longest path from the root to a leaf. In the given binary tree, the longest path from the root to a leaf is A - B - D, which has 2 edges. Therefore, the height of the binary tree is 2.