Morris Postorder Traversal
Optimizing Space Complexity of Postorder Binary Tree Traversal from Average Time O(N) for Balanced Binary Tree and Worst case O(logN) for Chained or Skewed Binary Tree to O(1) using concept of Threaded Binary Tree, where N = total number of nodes in the tree
-
Algorithms and Data Structures: TheAlgorist.com
-
System Design: DistributedComputing.dev
-
Low Level Design: LowLevelDesign.io
-
Frontend Engineering: FrontendEngineering.io
Prerequisites:
The concept of Morris Postorder Traversal is explained in the video below. It is highly recommended that you please read the pre-requisite chapters mentioned above first, if you already haven't done so, and then watch the video for a better understanding. Please excuse my speech impediment while watching the video. Thank you for your patience.
Working Code:
Java code:
This is a Premium content.
Please subscribe to Algorithms course to access the code.
Python code:
This is a Premium content.
Please subscribe to Algorithms course to access the code.
Related chapter:
Instructor:
If you have any feedback, please use this form: https://thealgorists.com/Feedback.
