Search⌘ K
Home
Courses
Data Structures for Coding Interviews in C#

Post-Order Traversal

Explore how post-order traversal visits nodes in a binary tree by recursively visiting the left child, the right child, and then the root. Understand its implementation in C# within a binary search tree to see how nodes are processed in left-right-root order.

We'll cover the following...

Introduction

In post-order traversal, the elements are traversed in the “left-right-root” order. First visit the left child, then the right child, and then finally the root/parent node. Here is a high-level description of the post-order traversal algorithm:

  1. Traverse the left-subtree of the currentNode recursively by calling the postOrderPrint() function on it.

  2. Traverse the right-subtree of the currentNode recursively by calling the postOrderPrint() function on it. ...