In this video, we will go over the binary search tree data structure. We will first cover the general idea of what a binary search tree is and how one may go about inserting data into this structure as well as how one searches for data. Once we cover the general idea, we will move over into the terminal and implement the binary search tree data structure in Python. We will construct two class methods that will implement the search and insertion algorithms.
If you are unfamiliar with tree-like data structures, I would encourage you to watch first the series on binary trees. A binary search tree is a type of binary tree. It is important to understand the various terminology used in the context of a tree data structure (root, node, leaves, parent, child, etc.). If any of those terms are unfamiliar to you, or you would like to brush up on them, the binary tree playlist may be found here:
bit.ly/lp_bt
This video is part of a playlist on binary search trees:
bit.ly/lp_bst
Slides:
docs.google.com/presentation/d/1tffjb_9GjBpZ9RG-RCaO71F-L6pwllph-Dq4_j6ajaI/edit?usp=sharing
The software written in this video is available at:
github.com/vprusso/youtube_tutorials/blob/master/data_structures/trees/binary_search_trees/insertion_search.py
Do you like the development environment I'm using in this video? It's a customized version of vim that's enhanced for Python development. If you want to see how I set up my vim, I have a series on this here:
bit.ly/lp_vim
If you've found this video helpful and want to stay up-to-date with the latest videos posted on this channel, please subscribe:
bit.ly/lp_subscribe
31 июл 2018
