LeetCode Binary Tree Inorder Traversal Solution Explained - Java

Показать описание

Preparing For Your Coding Interviews? Use These Resources
————————————————————

Other Social Media
----------------------------------------------

Show Support
------------------------------------------------------------------------------

#coding #programming #softwareengineering

Рекомендации по теме

Комментарии

That clap at the beginning makes me alert and my mind says please be concentrate you gonna be learn something new

sivaganesh

Great Work Nick !
Whenever I saw that you have made a video on any leetcode question I become very happy because I know I will connect with your logic and your thought process.

harshitsaxena

Coming back after a year, still impressed...keep up the brilliant work Nick!

samyakjain

Nick you explain well, your implementations are brilliant. don't torture yourself!!! The only thing you need is a white board stuff(maybe e-version) to show more details. Especially for beginners it's sometimes hard to read only from code.

giorgi

You can use recursion for this. It's much easier. Your call stack may increase but it's still gonna be O(n) for both time and space.

mudassirshahzadkk

class Solution {
List list = new ArrayList<Integer>();
public List<Integer> inorderTraversal(TreeNode root) {
if(root == null){
return list;
}

inorderTraversal(root.left);
list.add(root.val);
inorderTraversal(root.right);

return list;
}
}

amanmalhotra

TODO: take note of this, doing inorder traversal without using recursion

mostinho

what is the use of storing the root to current? why cannot we use the root for traversing through the tree?

mohamedsalman

at 6:47 I died hahahaha the explanation is confusing if u're hearing it for the first time, but hearing it again will eventually make sense xD

hanscesa

public class Solution {
public IList<int> InorderTraversal(TreeNode root) {
IList<int> res = new List<int>();
addData(root, res);
return res;
}

private void addData(TreeNode node, IList<int> res){
if(node==null)
return;
addData(node.left, res);
res.Add(node.val);
addData(node.right, res);
}
}

mohammedghabyen

I wonder if the recursive version would give you a better performance rating in java bytecode.

Gideon_Judges

so it was medium problem way back in 2018 and now its under easy category :D

paulsnehasish

i cant understand plz help..how it going to root first instead of right node after executing 22 line.

abhinavdadhich

I just have one question, should the one be smart so he can solve those problems? how can I solve new problems by myself if every problem has a new idea

ty

Can someone explain why time complexity is o(n) even if we are using two iterations?

henry

Nick great stuff you doing. Explanation does make sense but yeah don’t be nervous as it overwhelms. But keep doing leetcode series

nehurane

2022, now this problem is moved to 'easy'..?

sproutboot

This is from about a year and half ago. Nick, my main man, I bet you could redo this video with a cleaner and little clearer explanation by now. That being said, I did understand after watching this a few times. Also(if you even read these), Did you get the job at Amazon?

curtism

i call it "thanks for nothing explanation"

andreykovalov

why not apply a recursion? Is this more efficient?

mrproteinz

LeetCode Binary Tree Inorder Traversal Solution Explained - Java

Iterative & Recursive - Binary Tree Inorder Traversal - Leetcode 94 - Python

LeetCode Binary Tree Inorder Traversal Solution Explained - Java

Construct Binary Tree from Inorder and Preorder Traversal - Leetcode 105 - Python

Binary Tree Inorder Traversal - LeetCode 94 - Python (Recursive and Iterative!)

Binary Tree Inorder Traversal | Java | LeetCode Solution 94

Binary Tree Inorder Traversal - Recursive Leetcode 94

LeetCode 94. Binary Tree Inorder Traversal RECURSIVELY - Interview Prep Ep 66

Leetcode 94. Binary Tree Inorder Traversal

Create Binary Tree from pre-order and in-order traversal (LeetCode 105) | Easiest explanation

Собеседование в IT | LeetCode | 94. Binary Tree Inorder Traversal

LeetCode 94. Binary Tree Inorder Traversal Solution in Python

LeetCode 94. Binary Tree Inorder Traversal ITERATIVELY - Interview Prep Ep 75

Разбор задачи 94 leetcode.com Binary Tree Inorder Traversal. Решение на C++

[Java] Leetcode 94. Binary Tree Inorder Traversal (Iteratively & Recursively) [Binary Tree #2]

Binary Tree Inorder Traversal | Morris Traversal | Leetcode-94

Binary Tree InOrder Traversal #leetcode #python

LeetCode 105. Construct Binary Tree from Preorder and Inorder Traversal (Algorithm Explained)

How to code Inorder Traversal Leetcode Solution| Tree Data Structure Full playlist C++ | Hello World

Binary Tree Inorder Traversal || Leetcode 94 || C++ Solution

Leetcode 94 - Binary Tree Inorder Traversal (Java, Solution Explained)

Binary Tree Inorder Traversal #leetcode #csharp #easy

LeetCode Solution - 94 Binary Tree Inorder Traversal | Morris Traversal Algorithm Javascript

How To Solve '94 Binary Tree Inorder Traversal' on LeetCode - JavaScript Easy

Binary Tree Inorder Traversal LeetCode Solution | Tree Traversals Explained