Binary Tree Part 1 | BST | Binary Search Tree - Data Structures & Algorithms Tutorials In Python #10

[@codebasics]

Do you want to learn python from me with a lot of interactive quizzes, and exercises? Here is my project-based python learning course: codebasics.io/courses/python-for-beginner-and-intermediate-learners

[@jorgegonzaloalfaro5378]

'think about it, what will you do here?!' this guy is awesome.

[@codebasics]

:)

[@markmariscal5111]

This needs to have the most plays for best explanation for Binary Tree! I pray you do algorithms in python as well that is a class I would purchase.

[@actionsupplymining4242]

Yes rightly said

[@kasyapdharanikota8570]

true

[@chiemerieokoro3038]

You are a great teacher. This series is supposed to be called Algorithms and data structures made easy. Thank you chief.

[@rajeshpurshottamgupta8752]

Sir i usually watch videos in hindi because i grab the things more quicker than english tutorials but your explanation is very impressive the way you explain the things are excellent god bless you sir and i am praying that you stay healthy.

[@riyana2428]

Today, I learned amazing recursing techniques. Thank you so much sir.

[@codebasics]

I am happy this was helpful to you.

[@lalitameena3321]

Thanks a lot for posting these videos. I have been procrastinating algorithms and data structures for a while coz I wasn't able to understand data structures apart from arrays as well as recursion and after watching this video I am implementing linked list and BST in Python in just one day :D

[@etorty_dev]

These are the best video series on data structures and algorithms! Keep up the great work, Codebasics!!

[@jaheerkalanthar816]

very honestly sir, This is my first tutorial i clear the problem within one hour, Dhaval sir u r a great teacher,please upload some more videos about improve programming skills,how improve logical thinking please sir, I really love u sir,May god bless for long live for u sir

[@codebasics]

Glad you liked it 😊👍

[@suharam.s6570]

This playlist contains all my "Data Structure" course from Degree. So helpful for preps. :)

[@songs123d]

The sorting time complexity is O(H). H=height of the BST its important difference since if every child have only 1 child on 1 side, then time complexity can reach up to O(n) time. n=number of nodes.

[@namratashinde9157]

Easiest tree tutorial i have ever seen👍

[@winnienakimuli210]

Sir, you are a lifesaver, the best tutorials on data structures and algorithms; thank you greatly. I am forever grateful, and I will recommend your tutorials to all my colleagues, thank you so much!

[@tharindusathsara3414]

Really very happy about finding such an obvious and understood funny video series about data structures and algorithms. Everything is 100% clear with deeply explained theories and well-understood practicals. Also, the exercise series with the videos are highly appreciated. Dear sir thank you so much for the fantastic video series. ❤💖

[@MuraliChari]

This is better than a paid course. Great stuff!

[@codebasics]

I am happy this was helpful to you.

[@deghanandreddy7168]

Please upload the playlist of all Data structures regularly

[@Ankurkumar14680]

Thanks a ton Sir, Data structure series is much-appreciated series as it is the foundation of programming. Also, lots of University exams are pending due to COVID-19, series on data structure will really help. Amazing teaching skills :)

[@codebasics]

Glad, you liked it Ankur.

[@Nimmi_bro]

very clear concepts videos.. Thank you so so much

[@kirandeepmarala5541]

Sir, Thanks a Lot.I don't know how to appreciate You..Sir, Please make this Series complete end to end..Please..

[@RadhamaniRamadoss]

Thankyou very much sir for these amazing videos.. After 15 years I am learning these concepts again and now I am getting these concepts more clear because of your crystal clear and simple way of explanation. I have a query in the way your have defined elements in inorder,preorder and posrorder traversal. sometimes you have added as elements += self.left.in_order_traversal(). Sometimes it is elements.append(self.data) , sometimes elements = [self.data]. Looks like the list is appended in 3 different ways: += , appened, []. Please explain when do use each of these.

[@codebasics]

1) Append is to insert a single element into an existing list 2) += is two join two lists into a single list 3) [] is used to initialize a new list They all serve a different purpose

[@RadhamaniRamadoss]

@@codebasics It makes sense now.. Thankyou sir. Keep up the good work. God bless you

[@someguy6076]

Sure wish that I had found this video 6 weeks ago ... it is literally the entire assignment that I had to write.

[@PythonisLove]

I am just so impressed by your explanation technique. Thankss!!

[@codebasics]

Glad it was helpful!

[@ftt5721]

Thanks. I learned that in-order traversal in BST returns elements in ascending order.

[@ahmedel-sinousy4848]

thank you.....you are the best....finally I understand Binary Search Tree because of you....Thank You Again ^-^

[@codebasics]

Glad I could help!

[@vanchark]

There is an error at around 21:30. You must return 'self.left.search(val)', otherwise your result will be 'None" since nothing is being returned to main.

[@JaviMstv]

true, he forgot to put it in the < case, so only values greater than root worked... it took me some mins to realize what was wrong lol

[@pharaoh9483]

He corrected this later in the video.

[@Vinicius-nd8nz]

You are amazing, so easy to learn from you!! An excellent teacher!

[@yuanweidonuts]

I have a question. If we start the input element [ ] from the minimum number, for example, 1. Does it still work? Cause it seems like the whole number tree is on the right side. Do we need to add some conditions or limitations to the input element? Or the right-side tree is okay?

[@thesoundguysam5225]

What if the number_list was [1, 4, 17 .... ]. In that case through your code, the root node would be 1 and the entire tree would be created to the right side of the root node. That means the root node is not really in the center of the two sub-trees. Then how exactly is this In-order traversal if there is no left sub-tree at all?

[@kmnm9463]

Hi Dhaval, You have presented the coding magic behind BST in a incisive way. Very precise in the coding structure. Excellent , once again. I have been recommending your videos many and it is sure to have multiplier effect. Regards, Krish

[@RevvingBeast]

Best tip was how to recognize based on rootnode in post and pre order. Awesome

[@codebasics]

Glad it was helpful!

[@godza4735]

Thank you a lot !! Upload more and Algorithms like binary search etc..

[@BrasEren007]

thank you so much for uploading this video

[@A.bensalih]

awesome explanation!

[@humbertoventura1344]

this is well explained. Well done.

[@BarongoCalvine]

Thanks for the tutorial, they are really helping me, I have a DS interview coming up!

[@codebasics]

Glad I could help!and wish you best of luck for your interview 😊👍

[@lemon.sandwich]

How did the interview go?

[@Pattii248]

Amazing tutorial, thank you!

[@marianpascu8474]

Hi, just a curiosity. Since BST is recursive, should not the time complexity for searching or inserting actually be O(nLogn)?, rather than O(logN)?

[@sarveshsawant7232]

Thanks man, this is gold

[@banugoud2217]

superb.............................................

[@joxa6119]

If you are new, please watch the Recursion topic on the last chapter in this series, because this topic will use Recursion concepts extensively as should become the pre-requisite before you started.

[@shivamdubey4783]

self.left.add_child()sir plzz explain what is this how this works you have not explained anuything like this in python

[@pkavenger9990]

I really get surprised when some people actually work in white background. I think it is better if you use black background, it is easy on the eyes of people who are watching the video.

[@kmnm9463]

Hi Dhaval, While going through the video again, I thought in the traversal for In Order and Pre Order, 23 comes before 20, as while visiting a node in DFS, the tread is till the leaf and then the previous nodes. This is my understanding. Please let me know if I am missing something. Want to get that cleared. Regards, Krish

[@kashishshah5650]

Need to add return self.left.search(val)

[@sagarkbasutkar]

How can I insert "null" or missing node values to this implementation? @codebasics ?

[@DiaaHaresYusf]

hi , I tink the slid where you explaining the pre_order is having in correct array : [15, 7, 12, 14, 20, 23, 27, 88] -> I am using the same exact method and its not making an output like the one on slides , thanks

[@DiaaHaresYusf]

sorry , I was using the same in_order_traverse inside post_order and pre_order 😂😂😂😂😂😂😂😂

[@netraamrale3850]

Data Structures Made easy. You are amazing sir, I understand the complete concept with USE CASE(Very important) in one shot. Moreover, how the complexity is calculated.Sir, may I know your name?

[@codebasics]

Thanks 🙏 my name is Dhaval Patel

[@priyanshupurohit5431]

Thankyou for creating the series sir , i am really enjoying and learning a lot from this :)

[@chaitanyareddy7597]

Hello Dhaval, Much appreciated and many thanks for educating us. For the in order traversal , i some how feel that we can use list as class variable and then append the node data when we hit the exit condition of recursion to reduce the confusion which i felt. def in_order_traversal(self): if self.left: self.left.in_order_traversal() BinarySearchTreeNode.in_elements.append(self.data) if self.right: self.right.in_order_traversal() return BinarySearchTreeNode.in_elements

[@prithirajbhuyan4137]

i cpoied this function, but it says in_elements is not defined....

[@chaitanyareddy7597]

@@prithirajbhuyan4137 did you declare the in_elements array in the binary tree node class ?

[@prithirajbhuyan4137]

@@chaitanyareddy7597 yeah

[@aswath8265]

Bro we r just calling that function how does it returns some value

[@vidhanrathore5954]

Thanks a lot sir

[@aswath8265]

Can't understand that inorder transverse function sir where can I find it

[@hermanunspieters6969]

Thanks a million

[@sharifmansuri607]

Thanks for this series of data structure, it's helped lot

[@codebasics]

👍😊🙏

[@gauravkantrod1205]

Great Video but you can us extend instead of "elements += self.left.in_order_traversal()"

[@aswath8265]

Bro we r just calling that function how is the data inserted

[@veereshkammara9139]

great work sir

[@codebasics]

Glad it was helpful!

[@kzr_567]

Hi, at 18:07, you have ' elements = [] ' , arent you re initialising the list and recursively it should not save the appended elements??

[@omkarnag24]

the function in_order_traversal runs separately everytime it is called. So the data stored in 'elements' is different for each call of the function.

[@austinscott1407]

it's a local variable, if you run the function 10 times it will allocate a new place in memory each time the function runs.

[@arthireddyannadi8121]

Sir, Thank you for the tutorial, it helped me to understand BST better. However, I have a small doubt. For the above methods, when we are checking the search for the strings, we received none for sweden and uk. we modified the code using 'return'. However, when we used the same method for list of numbers , we got the boolean results correct. Could you please explain me why?

[@mukulkathayat6288]

Solution for post and pre traversal seems to be incorrect, maybe I'm wrong but it's only working when the list is already arranged in pre_order mode...........

[@beimnetguta3953]

Helpful

[@ashishmaikhuri3950]

Where is the video you told you will share the link for the Tree terminology

[@justjhonmichael7815]

Man, you deserve a sub!

[@codebasics]

I appreciate that!

[@devendudileep1149]

Is this playlist enough for technical round in the interview to atleast implement the basic logic?. Someone plz do reply.

[@smaransure2234]

what if a node has two branches that are bigger value than the node but left is the smaller value and right is the bigger value

[@LamNguyen-jp5vh]

Hi, I have a question about the binary search tree. Is it possible if the right child node under node 7 at 5:56 is a number that is greater than 15 (for example 16). I think we can because you just mentioned that the right child node is larger than the value of the parent node and the left child node is lesser than the parent node. If 16 is able to be added under node 7, will the binary search algorithm for number 16 have some problem at the beginning, we choose to find the number from the right branch because 16 is larger than 15. I'm sorry for this long comment but I will appreciate any help! Thank you so much and have a great day!

[@LamNguyen-jp5vh]

I figured it out! I will still leave it over here for anyone that has the same concern as me.

[@fahadreda3060]

Another Great video , Thanks man , Love your videos , Learned a lot from them

[@ফকিরতালিব]

Thanks, I am grateful to you!

[@maroofkhatib3421]

I have a small question to ask, Why are we defining the methods inside the class ? such as add_node, since root node is required everytime we add a node, It will unnecessarily increase the space complexity.

[@meralmaradia4774]

Hello Sir, can you please create a video developing of project using only DSA ?

[@ibadrather]

Ammmaaaaaaazingggggg

[@magnacarta7045]

Great tutorial, but could you please explain the line 14 self.left.add_child(data) part and the other ones that does the recursive function? Like what does the self.left have to do with the function? It doesn't change the value of the data right? So it just calls the function again with the same data.

[@magnacarta7045]

like, how does the value of self.left change after calling the function again?

[@rahulganesh468]

@@magnacarta7045 I think the way it works is that it keeps calling itself until the self.left == None, or there are no other elements on the left. Then it assigns the node to be that new left element, so ig that's how it changes? I could be wrong so feel free to correct me

[@austinscott1407]

@@magnacarta7045 If you have a tree with 3 elements in the left node, then you call the function on the base node's self.left. Then the function calls itself on THAT node's self.left, which is like calling it on self.left.left on the original function. Eventually you get to the final node, which has self.left == None which is how the function knows when to stop

[@sandeepjerubandi4473]

I am the fresher here and do i need these coding skills to crack any interviews bcoz i am pretty good at those topics but not on coding. Please reply anyone please!..

[@idontknowwhattoputherethatsit]

Tip for watching. play the video at 1.25x

[@patrickcarrera5956]

Is there any reason on line 45: self.left.search(val) and 51 we have the same thing but rigth... but now we add return? any reason we why need to return this part, figure those lines are just to jump from nodes to nodes, why do we need to return one and not the other?

[@jaypatel2436]

Sir, thank you for the session. However, We have to find all 3 traversals (in order , preorder, post order) by given graph. But the code is taking list as an input so how can I convert that graph into list

[@SwagatSusmoy]

​ @codebasics this is going to be a very specific request but can you please add a video explaining how to balance a binary tree to get the optimum performance and some of the special trees like AVL... Would be really helpful. I genuinely appreciate your work and have shared your playlists with my friends too. Thank you so much.

[@Jack_X075]

Outstanding tutorial. Great refersher!!

[@codebasics]

Glad you liked it!

[@riyabgia7220]

Thank you.

[@technicalutkranti]

Great explanation sir :)

[@cozmo7344]

Ty very much for the explanation, i found it very easy to implement and understand but i have a question. Is it possible to do an AVL tree using this algorithm? I find it very hard to do

[@edwinjonah]

Amazing! Thanks a lot

[@codebasics]

Glad you liked it!

[@studyonly9080]

At 8:20 , Please anyone review 🙏🙏 is Post order Traversal correct ? or will it be like this - [7, 14, 12, 20, 23, 88, 27, 15]

[@vaddinimisha5100]

Can u please make video on implementation of B+ tree in python

[@r.vigneshkumar81]

00:01 Binary search tree is a special type of binary tree with ordering criteria 02:45 Binary Search Tree properties and search efficiency explained. 05:27 Binary search tree offers efficient search and insertion operations 08:11 Understanding inorder traversal in Binary Search Trees 10:47 Adding nodes to a binary search tree involves checking for existing values and determining the correct subtree to place the new node 14:03 Explanation of in-order traversal method in binary search tree 17:20 Building Binary Search Tree and its utilities 20:15 Recursion in binary search tree search operation 23:00 Enhance Binary Search Tree Node Class with Additional Methods

[@SKumar-Munna]

Nice explanation sirji. (y)

[@papercut._.]

can someone explain how elements = [] can store values even after it is being re-initialized every time recursively at 18:07 and also the traversal function is wrong it gives wrong results please correct it, it fails to switch between the right of the left subtree and left of the right subtree. it just prints all the left together and all the rights together

[@crabbyfish3691]

Please, think before you write. Every time the function is called, a new elements variable is temporarily created. So there is an element list for every function call (This isn't a waste of memory since the variable are deleted after the function returns).

[@austinscott1407]

'elements' is not a global variable, it's local to the traversal function. So you call a traversal function and it allocates memory for a variable 'elements'. Then the function is called again recursively, and that newly called function also has it's own allocated memory which we've defined as elements. Two (or more) functions can have the same local variable name and still refer to different memory allocations

[@gopalraichand4810]

your tutorials are good but sir please try to thoroughly

[@Picker22]

great content

[@codebasics]

I am glad you liked it

[@DrKane96]

whenever coders get any problems, indians always give solutions

[@ai4sme]

Hi everyone! One question: with numbers =[17, 4, 1, 20, 9, 23, 18, 34], if I do numbers_tree.add_child(13), and check print(numbers_tree.right.data), 13 does not appear. However, the function in_order_transversal() is OK (output = [1, 4, 9, 13, 17, 18, 20, 23]). Any clue about it? Thank you!

[@AdamACastaneda]

If you built the tree with 17 as the root node (which is what this code does root = BinarySearchTreeNode(elements[0])) then the right node must be bigger, so I am guessing it will be 18. When you do add_child it runs through each node and checks to see if it is less or more then keeps going down that path. For example with 13, it will check against 17 and say its less, so it goes to left subtree and compare against that node and recursively ask less or more. 13 will end up SOMEWHERE in the LEFT subtree of 17.

[@shivrajmandavgde7907]

please upload regularly

[@codebasics]

Yes I will be uploading more videos on this series

[@amirdaneshmand9743]

Truly great, thanks!!

[@codebasics]

You're very welcome!

[@ankitagupta919]

what is the base case for in order traversal

[@swaroopkv4540]

What is difference between just recursively calling method and calling method using return?

[@saravanan.r5079]

Found the answer? I badly need it

[@anilkumarjha8055]

🙏thnx sir 🙏

[@JobishJoseph-lp8ln]

Easy remember, P -> Parent L -> Left R -> Right L will always come before R Only key is to remember the Position of P which will be first,middle, last. Pre means first → P L R Post means last -> L R P InOrder means Middle -> L P R

[@ayushjhajriya4033]

my search function is not working. it is giving me output None. please help me to find mistake in my code.

[@surajagasti2309]

pls upload regularly

[@codebasics]

sure

[@suryakantnayak6661]

sir can you make your voice a little softer it sound more metallic and sounds a bit harsh to listen. Thank you.

[@vishalsiram1305]

sir what model accuracy is best ? please reply sir

[@ayushjhajriya4033]

this is giving output None, why? def search(self,val): if self.data==val: return True if val < self.data: if self.left : self.left.search(val) else: return False if val > self.data : if self.right: self.right.search(val) else: return False

[@vanchark]

you must return self.left.search(val) and self.right.search(val). otherwise no results will get brought back