Binary Search Tree: Traversal & Height - Beau teaches JavaScript

Subscribers:
10,700,000
Published on ● Video Link: https://www.youtube.com/watch?v=Aagf3RyK3Lw



Duration: 14:01
32,449 views
361


This video builds upon the previous binary search tree video. Find the height of a binary search tree. Also, use use depth-first and breadth-first search through in-order, pre-order, post-order, and level-order traversal.

▶Part 1: https://youtu.be/5cU1ILGy6dM

💻 Code: http://codepen.io/beaucarnes/pen/ryKvEQ?editors=0011

🔗 Info: https://en.wikipedia.org/wiki/Binary_search_tree

🐦 Beau Carnes on Twitter: https://twitter.com/carnesbeau

⭐JavaScript Playlists⭐
▶JavaScript Basics: https://www.youtube.com/playlist?list=PLWKjhJtqVAbk2qRZtWSzCIN38JC_NdhW5
▶Data Structures and Algorithms: https://www.youtube.com/playlist?list=PLWKjhJtqVAbkso-IbgiiP48n-O-JQA9PJ
▶Design Patterns: https://www.youtube.com/playlist?list=PLWKjhJtqVAbnZtkAI3BqcYxKnfWn_C704
▶ES6: https://www.youtube.com/playlist?list=PLWKjhJtqVAbljtmmeS0c-CEl2LdE-eR_F
▶Clean Code: https://www.youtube.com/playlist?list=PLWKjhJtqVAbkK24EaPurzMq0-kw5U9pJh

-
We're busy people who learn to code, then practice by building projects for nonprofits. Learn Full-stack JavaScript, build a portfolio, and get great references with our open source community.

Join our community at https://freecodecamp.com
Read great tech articles at https://medium.freecodecamp.com







Tags:
inorder
preorder
postorder
height
levelorder
bst