Morris Traversal - Flatten a Binary Tree to Linked List - C++ Placement Series
CodeHelp - by Babbar via YouTube
Learn AI, Data Science & Business — Earn Certificates That Get You Hired
Learn Backend Development Part-Time, Online
Overview
Google, IBM & Meta Certificates – 40% Off
One Coursera Plus subscription covers most Professional Certificates on Coursera.
Unlock All Certificates
This course explains Morris traversal and three approaches for flattening a binary tree into a linked list. It uses dry runs and C++ code to work through the algorithms.
Syllabus
- Morris Traversal
- Promotion
- Algo
- Flatten Binary Tree
- Approach #1
- Approach #2
- Approach #3
- Dry Run #1
- Dry Run #2
- Code
Taught by
CodeHelp - by Babbar