Binary Search Tree - Beau teaches JavaScript

A binary search tree is a tree data structure with only two branches for every node. Learn how to implement a binary search tree in JavaScript ES6! 💻 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 ❤️ Support for this channel comes from our friends at Scrimba – the coding platform that's reinvented interactive learning: https://scrimba.com/freecodecamp