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
L-3.9: Insertion in Heap Tree | Max-Heap & Min-Heap Creation | Time Complexities
What Is a Binary Heap?
Height of a Binary Tree / Maximum depth of a binary tree Algorithm [REVISITED]
What is an API ? Simply Explained
L-3.7: Introduction to Trees (Binary Tree, Almost Complete Binary Tree, Full BT, Complete BT, BST)
