bro one suggestion... instead of showing what to do it would be better if you told us why we are doing those operations and why specifically stack is used... what if we use a queue instead of stack, can we do the same question using a priority queue.
You should explain why recursive method or the first method which strikes our mind is not the best way to go and provide may be a pseudocode for that ,so that anyone preparing for interview have knowledge about implementing that approach also as more often interviewer expect us to build the solution from a slightly worst time complexity to an efficient solution.Just a suggestion for further videos.
I think 2 , 4 , 1 can represnt a bst a 2 is root , 4 is on right of it and root for 1.the sequence 2, 4, 1 can represent the preorder traversal of a binary search tree (BST). A preorder traversal of a BST visits the root node first, followed by the left subtree, and then the right subtree. One possible BST that has the preorder traversal 2, 4, 1 is: 2 \ 4 / 1 In this tree, the root node is 2, which is visited first. Then the left subtree is empty, so the traversal moves to the right subtree, where it visits the node 4. Finally, the traversal moves to the left subtree of 4, where it visits the node 1. This results in the preorder traversal 2, 4, 1.
Abey bro, we could have understood code from GFG(where u have taken this code from). We expected an intuition behind using Stack. You were simply dry running the code, hence disliked your video
bro one suggestion... instead of showing what to do it would be better if you told us why we are doing those operations and why specifically stack is used... what if we use a queue instead of stack, can we do the same question using a priority queue.
Noted!
00:00 Introduction
00:08 Validate BST from Preorder
02:00 Pseudo Code
09:47 Implementation
Great Explaination Sir!
Glad you liked it
Bhaiya why are u not making videos nowadays?
Ur teaching style is so good
Will resume uploading soon. Busy with some personal stuff. Keep supporting!
You should explain why recursive method or the first method which strikes our mind is not the best way to go and provide may be a pseudocode for that ,so that anyone preparing for interview have knowledge about implementing that approach also as more often interviewer expect us to build the solution from a slightly worst time complexity to an efficient solution.Just a suggestion for further videos.
thanks for the feedback :)
Great video bro....awesome!
thank you :)
You should explain, why it does rather than what it does?
Noted!
I think 2 , 4 , 1 can represnt a bst a 2 is root , 4 is on right of it and root for 1.the sequence 2, 4, 1 can represent the preorder traversal of a binary search tree (BST). A preorder traversal of a BST visits the root node first, followed by the left subtree, and then the right subtree. One possible BST that has the preorder traversal 2, 4, 1 is:
2
\
4
/
1
In this tree, the root node is 2, which is visited first. Then the left subtree is empty, so the traversal moves to the right subtree, where it visits the node 4. Finally, the traversal moves to the left subtree of 4, where it visits the node 1. This results in the preorder traversal 2, 4, 1.
Great video!
thanks!
Why is the condition "preorder[i] > top of stack" in the pseudocode?
thanks for this video!
welcome :)
Abey bro, we could have understood code from GFG(where u have taken this code from). We expected an intuition behind using Stack. You were simply dry running the code, hence disliked your video
thanks for the feedback
Awesome explanation ! need more such videos ! Just a tiny suggestion.. please use dark theme and code editor like sublime or VS Code !
Noted !
Good one
thanks :)
Is there an alternate approach using call stack instead of an actual stack?
Yes...this can be done via recursion too.
Sir can u please make a video on "Construct Binary tree from String with bracket representation ".
Thankyou
Try to explain how it is actually doing.
Noted
not helpful sorry bro
bro showing pre-order traversal first and then creating a tree from it casually. That's not possible