What is the order in which nodes of this tree are processed in inorder?

  • A: Z, =, Y, *, A, +, X
  • B: =, Z, +, *, X, Y, A
  • C: Y, A, *, X, Z, +, =
  • D: =, Z, +, *, Y, A, X
  • E: Z, Y, A, *, X, +, =

    Answer: A

    In inorder, the parent is processed in between its children. For this tree, that gives the same order as Java source code (infix).

    Contents    Page-10    Prev    Next    Page+10    Index