: Become a better programmer with audiobooks of the #1 bestselling programming series: https://www.cleancodeaudio.com/ 4.6/5 stars, 4000+ reviews. Get 40% off all four with the code LUCID In this video, we will go over the binary tree data structure. We then go over how to implement this data structure in Python. We then cover the three recursive depth-first search traversal algorithms (preorder, inorder, and postorder) and implement those recursively in Python. The software written in this video is available at: https://github.com/vprusso/youtube_tutorials/blob/master/data_structures/trees/binary_trees/binary_tree_recursive_dfs_traversals.py The slides for this video can be found here: https://drive.google.com/open?id=1OPqeIRnRyYLpFQPk7Wf0qmCUe-cMmAsI1hUqpab0B_s 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: http://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: http://bit.ly/lp_subscribe