Binary Search Tree on JavaScript, Traversals Breadth and Depth first search.

In this lesson we will understand what is binary tree, write an implementation in JavaScript, methods .add, traversalDFS: inOrder, preOrder, postOrder and traversalBFS 🍀 Support the channel: https://www.donationalerts.com/r/webelart ☕️ Buy me a coffee: https://buy.stripe.com/5kA7sL9574SG7xCfZ3 🥰 Buy my brushes for Procreate: https://webelart.com/illustration. ✍️ My telegram channel: https://t.me/webelart_en 🪆 Russian YouTube: @webelart 💁🏼‍♀️ My instagram: https://www.instagram.com/webelart 🦄 Company LinkedIn: https://www.linkedin.com/company/webelart Links: 🌺 https://towardsdatascience.com/4-types-of-tree-traversal-algorithms-d56328450846 🌺 http://blog.benoitvallon.com/data-structures-in-javascript/the-binary-search-tree-data-structure/ 📹 https://youtu.be/3X9gZ-41edA 00:00 Intro. 01:11 Definitions 02:37 class Node implementation. 05:21 class BinaryTree 05:42 method add. 10:46 traversals 13:32 method traverseDFS 16:18 differences between inOrder, preOrder, postOrder 17:15 method inOrderDFS, preOrderDFS, postOrderDFS 19:07 test preOrderDFS with debug 23:09 test inOrderDFS with debug 24:40 test postOrderDFS with debug 27:20 method traverseBFS With love, Elena Litvinova ❤️