Iterative Pre-order and Post-order | Solution
In this video, we discuss the logic and code the problem in which we are required to traverse pre-order and post-order in a generic tree iteratively rather than recursively.
Comments
Related Posts
1. Introduction to Algorithms
Database Administrators
Interview Question: Start of Loop in a Linked List
Data Structures using C Part 28 - Representation of Graphs using c | Adjacency Matrix Adjacency List
L-3.11: Build Heap in O(n) time complexity | Heapify Method | Full Derivation with example
