Binary Search Tree Tutorial - Traversal, Creation and More

Ready to learn about Binary Search Trees? In this video I discuss what a binary search tree is and talk about how to create one. I also discuss traversing a BST using Postorder, Preorder and Inorder traversal methods. We will see how these work with visual examples as well as coding implementations in python.

Thanks to Linode for Sponsoring this video!

◾◾◾◾◾
💻 Enroll in The Fundamentals of Programming w/ Python

◾◾◾◾◾◾

⚡ Please leave a LIKE and SUBSCRIBE for more content! ⚡

Tags:
- Tech With Tim
- Python Tutorials
- Binary Search Tree Tutorial
- BST
- Binary Search Tree Traversal
- Postorder, Inorder, Preorder
- Traversing Binary Tree
- Creating Binary Search Tree

#DataStructures #BST #BinarySearchTree

[jathebest]

Again I came here after not understanding the concept in another video and yes, Tim never disappoints me.. His video was clear and it's even easy for beginners like me to grasp the code.. Thanks million..!

[Y_Nt]

Dude, this video is pure gold. I'm trying to really get into algo and data structure and this is clearing up so many things for me ! It deserves way more views !

[floydian]

Tim please continue making these long videos. I love the in-depth knowledge

[forsakengod]

So thankful of youtubers like you. Thank you so much I get it now.

[fiendsgaming]

This is the best thing because they're teaching me same thing in my current semester, <3

[pramit]

This video is just wow.. Thank you.. no one could have explained this better

[vlad]

I finally understand how to implement BST in code. Thank you! Keep making videos. I will enjoy watching the next video about BST.

[Stafford]

If you are coming to the idea of a BST for the first time there is something you need to know. The idea is to take a piece of information like a surname, and convert it to a unique number. You do this with a 'hash function'. That number is the 'key' associated wtih that piece of data. The data is then inserted into a BST in the way described by Tim. Now if you want to search for a name, you obtain the'key' by hashing the name you want to search for. Using that 'key' you can swiftly search the BST and get the information associated with the key.

[innakli]

Awesome video, so easy to understand the concept. Helped me with my assignment. Thank you.

[nirsharony]

The insertion time to the tree is log(n) only if the tree is balanced, If you insert a set of numbers are in increasing (or decreasing) order, you end up with a binary tree that has a height of (n)

[KirubelTamene]

Tim I can't thank you enough!!!
Thank you

[korhandemir]

what a king, thx brother luv from Turkey!!!

[TricoliciSerghei]

Great presentation, easy and to the point!

[DmitriiTarakanov]

Thank you for your work! It is really good explanation allowing to get known and understood the foundation

[vaishnavikorgaonkar]

It would be great if you show output as well.

[ningzedai]

The implementation of "add" will fall into a linked list if the elements are inserted in perfect order. So the time complexity will degrade to O(n), which is not log(n) anymore.

[smitpatel]

In the add() function, aren't we supposed to declare current = self.ptr_to_root? Because, otherwise how can we use it the way we have?
It is not defined at all.
Please explain me If I am wrong!
Wanting to learn.

[programmingpython]

I think code for traversing is wrong... You are not handling the None case, like when we reach the end of the tree, we cannot print any thing like node.value.. please have a look

[Nick-uobi]

Please make a full Python DSA and DP ..There isnt any currently on YouTube in python language.

[sankethb.k]

Awesome,
Looks like you are learning data structures in your college :D