Please likeeee, shareeee and subscribeeeeeeee :) Also follow me at Insta: Striver_79

@amishasahu1586

2 жыл бұрын

Understood sir!!!

// NOTE: Q. How does inorder+preorder/postorder construct unique binary tree? -> Imagine that you have the following pre-order traversal: a,b,c,d,e,f,g. What does that tell you? You know that a is the root of the tree, this follows from the definition of a pre-order traversal. So far, so good. You also know that the rest of your list is the traversal of the left subtree followed by the traversal of the right subtree. Unfortunately you don't know where the split is. It could be that all of them belong to the left tree, it could be that all of them belong to the right tree, or b,c go left and d,e,f,g go right and so on. How to resolve the ambiguity? Well, let's take a look at the in-order traversal, what is its defining property? Any elements in the left subtree of a will come before a in the in-order traversal and any elements in the right subtree will come after a. Again, this follows from the definition of in-order traversal. So what we need to do is take a look at the in-order traversal (let's say it's c,b,a,d,e,f,g). We can see that b and c come before a, therefore they're in the left subtree, while d,e,f and g are in the right subtree. In other words, as position in the in-order traversal uniquely determines which nodes will be in its left/right subtrees. And this is great because we can now go on and solve the two subtrees recursively: pre-order b,c/in-order c,b and pre-order d,e,f,g/in-order d,e,f,g. And you can continue this recursively until all subtrees only contain a single element, where the solution is trivially unique. And since at each step we could prove that there is only one valid way to continue, the result is that a given pair of in-order and pre-order traversals can only belong to a single tree. NOTE: found this on Quora. It might help.

@nagame859

8 ай бұрын

thanks, sir.

@ritikshrivastava9442

8 ай бұрын

one more thing to note u can construct unique bt only when all the values in bt is unique

@rishabhgupta1222

29 күн бұрын

@@ritikshrivastava9442 nope it depends on node's address and not value

Recalled @Jenny's lectures CS/IT NET&JRF suddenly after 2 years, seeing the concept.

Thank You So Much for this wonderful video..................🙏🙏🙏

Really Bhaiya , your effort means allot to Student community, Your videos are awesome.

thanks for awesome explanation striver bhaiya :)

thanks for the great content

This guy has the same enthusiasm in all videos!

If you have a perfect binary tree, then given only the PREORDER and POSTORDER, you can construct your unique binary tree Source: NPTEL IIT DELHI, DR. Naveen Garg

@niranjansaha5135

Жыл бұрын

if it is a perfect binary tree, then with a single order traversal we can construct the tree. Am I saying anything wrong???

@parthsalat

Жыл бұрын

By perfect, you mean a complete binary tree, right?

@parthsalat

Жыл бұрын

@@niranjansaha5135 I guess, you are right

@SHASHANKRUSTAGII

Жыл бұрын

@@parthsalat right

@rishabhgupta1222

29 күн бұрын

@@parthsalat no its wrong both are different

Very helpful

the best teacher

Thank you Bhaiya

tysm sir

thanks

Understood! Such an amazing explanation as always, thank you very much!!

Thanks u

Nice

understood sir

Understand

One exception for this is.. If we have only one node in binary tree then we can construct unique binary tree from preorder and postorder traversal. Preorder: 1 Postorder: 1 Unique binary tree: 1 (Root node) Sounds like funny but we can explain this edge case in interview and can have more advantage 🙂

@ShivamJha00

Жыл бұрын

bruh

@tarun_sahnan

Жыл бұрын

if you have only one node that only there is no need for 2 traversal only one traversal will give you the solution. Preorder -> 10 10 is the root node

i best understood the concept from your videos sir thank you

understood

Excellent Explanation!!!

🔥

Kudos to your effort!

Thanks bro for prior explanation

Gonna complete the series tonight

@sangdilbiswal30

24 күн бұрын

Hell yeah

sir, what is the reason behind the fact that the inorder traversal along with any one of the remaining two traversals gives a unique binary tree and why not any other combination??

@sparshsharma6068

2 жыл бұрын

I think that, Since In inorder traversal, we can identify the left and right subtrees of a node but, the same won't be true in the case of the remaining traversals. Consider the following tree: 1 / \ 2 3 / \ / \ 4 5 6 7 / \ / 8 9 10 Inorder traversal of this tree will be: [8,4,9,2,10,5,1,6,3,7] (LNR) postorder traversal of this tree will be: [8,9,4,5,2,6,7,3,1] (LRN) preorder traversal of this tree will be: [1,2,4,8,9,5,10,3,6,7] (NLR) Now, from this traversal, we can easily see that all the nodes on the left side of node 2 in the inorder traversal will form the left subtree. So that's why inorder along with post/preorder must give unique BTree.

@Yash-uk8ib

2 жыл бұрын

@@sparshsharma6068 i think u have got a point!! Agreed!! Thanks for ur kind reply.

@sparshsharma6068

2 жыл бұрын

@@Yash-uk8ib Happy to help😊

@vibhu613

2 жыл бұрын

@@sparshsharma6068 great Explaination

@sparshsharma6068

2 жыл бұрын

@@vibhu613 Thanks😄

Huge respect ❤👏

this is awesome !

great tip!

we love your content and we love you.....🖤

you are just amazing sir

Very Good content striver

Excellent Bro, perfect

why the inorder traversal along with any one of the remaining two traversals gives a unique binary tree and why not any other combination??

@priyanshkumariitd

4 ай бұрын

Because we need to know not only the root but the left subtree & right subtree as well. So, one of the traversal should be inorder to identify UNIQUE BT.

thanks mate!

Thank you bro!!

understood!

@SatyamEdits

Жыл бұрын

Hi Tanya ...!! Nice to see you ...again...!!! if you remember.....😅

Best content brother

understood :)))

Undersstod! 👍

Amazing 👏👏

thank you striver bhaiya

Thank you sir

Understood!

Thanks :)

Understood kaka

understoooood

Done till now 🥺🥺🥺 thankyou striver ❣️❣️

Keep making this videos bhaiya

understood.

Understood

Understood:)

💚

"US"

Bawaal🔥💪

noice video

completed lecture 33 of free ka tree series.

Striver Bhaiya zindabad!!!

reach++

"us"

Wow waiting for this 👍

................

boooooooooooooooooooooooooooooooooooooooom

first :)

@ojasdighe991

2 жыл бұрын

🔺🔺

what if all the nodes have same value then answer wont be unique

understood

understood!

Understood

understood

Understood

understood

understood

understood

Understood