postorder traversal

'postorder traversal' can also refer to...


More Like This

Show all results sharing this subject:

  • Computing


Show Summary Details

Quick Reference

A tour of the nodes of a binary tree obtained by using the following recursive algorithm: visit in postorder the left subtree of the root (if it exists); visit in postorder the right subtree of the root (if it exists); visit the root of the tree. Compare preorder traversal, symmetric order traversal.

Subjects: Computing.

Reference entries

Users without a subscription are not able to see the full content. Please, subscribe or login to access all content.