Perform inorder traversal on the following binary tree:对以下二叉树进行中序遍历:
When the node c has just been accessed, the elements in the stack from the top of the stack to the bottom of the stack are:节点c刚被访问完毕时栈中的元素从栈顶到栈底为:
Ad, c, f
Bd, f
Cf, g, d, e
Dd