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

Post-Order Traversal

Explore the post-order traversal technique for binary trees by learning to visit nodes in left-right-root order. Understand its recursive implementation in C++ within a BinarySearchTree class to effectively visit all nodes after their children.

We'll cover the following...

Introduction #

In post-order traversal, the elements are traversed in the “left-right-root” order. We 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 sub-tree of the currentNode recursively by calling the postOrderPrint() function on it.

  2. Traverse the right sub-tree of the currentNode recursively by calling the ...