title: is this post order forest traversal correct?
body: <p>I have a problem understanding how to traverse a forest post-order. the definition for it is: <a href="https://books.google.com/books?id=8JRDDAAAQBAJ&amp;pg=PA330&amp;lpg=PA330&amp;dq=postorder%20forest%20traverse&amp;source=bl&amp;ots=OQwVmJxico&amp;sig=ubOPoMR0hLnFVZRB_5h_OOF5E14&amp;hl=en&amp;sa=X&amp;ved=0ahUKEwiLmcuA_7nYAhUGalAKHWDOC5UQ6AEITDAH#v=onepage&amp;q&amp;f=false" rel="nofollow noreferrer">(source: Data structures using C by Rohit Khurana page 330)</a></p>
  
  <ol>
  <li><p>traverse the subtrees of the first tree in tree post-order.</p></li>
  <li><p>traverse the remaining trees of F in tree post-order.</p></li>
  <li><p>visit the root node of the first tree of F.</p></li>
  </ol>
  
  <p>here is the forest:
  <a href="https://i.stack.imgur.com/no56S.png" rel="nofollow noreferrer"><img src="https://i.stack.imgur.com/no56S.png" alt="F forest"></a></p>
  
  <p>and the post-order traversal of it mentioned in the book is:</p>
  
  <p><strong>C F E D B Q P Z Y X A</strong></p>
  
  <p>but I think that P is in the wrong place and the correct answer for it is:</p>
  
  <p><strong>C F E D B Q Z Y X P A</strong></p>
  
  <p>I want to know whether my answer is correct or if the book's answer is true, why it is true??</p>
  
  <p>thanks,</p>