Make delicious recipes!

Ways in which a binary tree can be traversed:
  1. In-Order (Left-Data-Right): Used in sorting in ascending order.

  2. Pre-Order (Data-Left-Right): Used during cloning of a tree.

  3. Post-Order (Left-Right-Data): Used when freeing all nodes of a tree recursively or when evaluating calculator expressions.

  4. Reverse In-Order (Right-Data-Left): Used in sorting in descending order

  5. Reverse Pre-Order (Data-Right-Left)

  6. Reverse Post-Order (Right-Left-Data)

  7. Breadth-First Traversal

  8. Spiral Traversal




Like us on Facebook to remain in touch
with the latest in technology and tutorials!


Got a thought to share or found a
bug in the code?
We'd love to hear from you:

Name:
Email: (Your email is not shared with anybody)
Comment:

Facebook comments:

Site Owner: Sachin Goyal