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

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

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

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

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

#coding #programming #softwareengineering

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

Комментарии

Most of this explanation just bounced over my head! Hey Nick, can you please explain the algorithm a bit more clearly, before getting into the code. Because end of the day, logic and derivation of the solution is what matters right, and coding will be easy after that! Thanks for the video though.

ArjunKalidas

You can convert the in order array to a hash map storing {inorder val : index} to avoid looping through the in order array each time

trung.n

Not sure how he has so much followers. The solutions are either taken from solution or reporduced from memory without any explanations.

Aditya-rmbl

I find that the main time cost in this solution is from the for loop search part, you can reduce the time cost by using a hashmap for inorder element search.

zmanneverdie

Your solutions always explain the intuition behind the solution.

AkshayKumar-xhob

So finally you did this problem. I watched yesterday's live stream when you were solving this.

saiyamkumarsingh

Is there a way to improve look up for the inIndex?

evgeni-nabokov

Can you please also tell us the time and space complexity when making these video? Just subscribed. Yours is easier to understand than solution in discussion lol

brovet

Thanks Nick. You are awesome! Constructing Binary Tree from PostOrder and Inorder is very similar to this problem. In PostOrder, the sequence is "left, right, center", which means we need to loop PostOrder array from the end. Recursive inputs to root.left and root.right will also differ accordingly (but very similar to this video).

vinothbornwin

Your solution is always very concise. I was coding it and got all the index mangled up. Thanks for the video!

kittwwang

Great video!!! I took a while to understand the concept. Can you tell what is the time and space complexity for this approach?

suyashsorte

But in other sites like gfg they are passing preStart as prestart+1 in both root->left and root->right and still giving correct output. Can you explain why?

-ei

Good explanation of preorder, inorder and postorder

FitnessChaos

so u knoe how to reverse a linked list, but do u knoe how to design a large scale software system

lowkey_anp

If I am a novice to trees, what can you recommend? I couldn't understand the video.

emansrnme

Thanks for the video, it helped me. Do you know what would be the approach if the array would have repeated elements? (or the work around)

darod

Why code in this video get stack over flow?

카이트-cy

Just subscribed cause you said you can grow as you get more subscribers LOL We will help your channel grow, you help us learn data structures and algorithms. I appreciate you teaching us these concepts.

User_Unknown_Anonymous

In line 29, where does inIndex - inStart + 1 come from? In other words, how do you map inorder index to preorder index?

calfland

Nick, can you share your 2ms submission? Thanks

rodanm

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

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

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

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

Construct Binary Tree From Preorder And Inorder Traversal - LeetCode 105

LeetCode 105. Construct Binary Tree from Preorder and Inorder Traversal [Solution + Code Explained ]

[Java] Leetcode 105. Construct Binary Tree from Preorder and Inorder Traversal [Binary Tree #5]

LEETCODE 105 (JAVASCRIPT) | CONSTRUCT BINARY TREE FROM PREORDER AND INORDER TRAVERSAL

Разбор задачи 105 leetcode.com Construct Binary Tree from Preorder and Inorder Traversal. C++...

Leetcode - Construct Binary Tree from Preorder and Inorder Traversal (Python)

construct binary tree from preorder and inorder traversal leetcode | leetcode 105 | binary tree

Leetcode 105. Construct Binary Tree from Preorder and Inorder Traversal

105. Construct Binary Tree from Preorder and Inorder Traversal - Day 14/31 Leetcode July Challenge

Construct Binary Tree from Preorder and Inorder Traversal | Leetcode 105 | Live coding session

Leetcode 105. Construct Binary Tree from Preorder and Inorder Traversal

Amazon Interview Question Leetcode 105 Construct Binary Tree from Preorder and Inorder Traversal

LeetCode 105. Construct Binary Tree from Preorder and Inorder Traversal

Construct Binary Tree from Inorder and Postorder Traversal - Leetcode 106 - Python

[Leetcode 105] Construct Binary Tree From Preorder And Inorder Traversal

C++ leetcode 105. Construct Binary Tree from Preorder and Inorder Traversal

Software Engineer/Developer Interview Question: 105. Construct Binary Tree from Preorder

Leetcode 105 Construct Binary Tree from Preorder and Inorder Traversal | Coding Decoded SDE Sheet 🔥...

Construct Binary Tree from Preorder and Inorder Traversal: LeetCode 105

Leetcode 105 Construct Binary Tree from Preorder and Inorder Traversal (Animation)

L34. Construct a Binary Tree from Preorder and Inorder Traversal | C++ | Java