Thread by @Iampatelajeet

Binary Tree Inorder Traversal, today's @Leetcode challenge: Understanding the problem to intuition to solution, 3 approaches.

A thread 🧵
#100daysOfCode #leetcode

Problem Statement-
Given the root of a binary tree, return the inorder traversal of its nodes' values.

Understanding the problem-
It's a really standard problem: one of the DFS traversals.

Intuition-
In this traversal, for any subtree, we first choose left node, root, then right node. Let's see the approaches.

Solution: Approach 1- Recursion
Time Complexity: O(n)
Space: O(n)

Approach 2: Iterative
-> Uses stack to store the nodes.
-> Pick the root node
-> go to left most node, push all them in stack
-> Move to right subtree.
Time Complexity: O(n)
Space: O(n)

Approach 3: Morris Traversal
Basically it's the process of making the tree, skewed.
-> Pick the root node
-> Add it to the left most node at every step.
Time Complexity: O(n)
Space: O(1)

That's a wrap!

If you enjoyed this thread:

1. Follow me @Iampatelajeet for,
‍💻 Coding,
🌐 Case Studies,
👻 free ka gyaan,
🤖 tech stuffs and
😉 coding memes
2. RT is appreciated, share and let everyone be consistent. Start the practice challenge with me.

https://twitter.com/1241264907846209537/status/1567718375165394945