Introduction
You have learned about binary search trees – where you take a group of data items and turn them into a tree full of nodes where each left node is “lower” than each right node. The tree starts with the “root node” and any node with no children is called a “leaf node”. You have also learned about tree traversal algorithms like breadthfirst and depthfirst.
Now, let’s take a look at balanced binary search trees (BST). A BST allows fast operations for lookup, insertion, and deletion of data items. Read this article and watch this video to understand the basic algorithm used to build a balanced BST. Although the last resource does not use Javascript, you should understand it enough to develop your own pseudocode.
Assignment
You’ll build a balanced BST in this assignment. Do not use duplicate values because they make it more complicated and result in trees that are much harder to balance. Therefore, be sure to always remove duplicate values or check for an existing value before inserting.

Build a
Node
class / factory. It should have an attribute for the data it stores as well as its left and right children. 
Build a
Tree
class / factory which accepts an array when initialized. TheTree
class should have aroot
attribute which uses the return value ofbuildTree
which you’ll write next. 
Write a
buildTree
function which takes an array of data (e.g. [1, 7, 4, 23, 8, 9, 4, 3, 5, 7, 9, 67, 6345, 324]) and turns it into a balanced binary tree full ofNode
objects appropriately placed (don’t forget to sort and remove duplicates!). ThebuildTree
function should return the level0 root node.Tip: If you would like to visualize your binary search tree, here is a
prettyPrint()
function that willconsole.log
your tree in a structured format. This function will expect to receive the root of your tree as the value for thenode
parameter.const prettyPrint = (node, prefix = "", isLeft = true) => { if (node === null) { return; } if (node.right !== null) { prettyPrint(node.right, `${prefix}${isLeft ? "│ " : " "}`, false); } console.log(`${prefix}${isLeft ? "└── " : "┌── "}${node.data}`); if (node.left !== null) { prettyPrint(node.left, `${prefix}${isLeft ? " " : "│ "}`, true); } };

Write an
insert
anddelete
functions which accepts a value to insert/delete (you’ll have to deal with several cases for delete such as when a node has children or not). If you need additional resources, check out these two articles on inserting and deleting, or this video with several visual examples.You may be tempted to implement these methods using the original input array used to build the tree, but it’s important for the efficiency of these operations that you don’t do this. If we refer back to the Big O Cheatsheet, we’ll see that binary search trees can insert/delete in
O(log n)
time, which is a significant performance boost over arrays for the same operations. In order to get this added efficiency, your implementation of these methods should traverse the tree and manipulate the nodes and their connections. 
Write a
find
function which accepts a value and returns the node with the given value. 
Write a
levelOrder
function which accepts another function as a parameter.levelOrder
should traverse the tree in breadthfirst level order and provide each node as the argument to the provided function. This function can be implemented using either iteration or recursion (try implementing both!). The method should return an array of values if no function is given. Tip: You will want to use an array acting as a queue to keep track of all the child nodes that you have yet to traverse and to add new ones to the list (as you saw in the video). 
Write
inorder
,preorder
, andpostorder
functions that accept a function parameter. Each of these functions should traverse the tree in their respective depthfirst order and yield each node to the provided function given as an argument. The functions should return an array of values if no function is given. 
Write a
height
function which accepts a node and returns its height. Height is defined as the number of edges in longest path from a given node to a leaf node. 
Write a
depth
function which accepts a node and returns its depth. Depth is defined as the number of edges in path from a given node to the tree’s root node. 
Write a
isBalanced
function which checks if the tree is balanced. A balanced tree is one where the difference between heights of left subtree and right subtree of every node is not more than 1. 
Write a
rebalance
function which rebalances an unbalanced tree. Tip: You’ll want to use a traversal method to provide a new array to thebuildTree
function.
Tie it all together
Write a simple driver script that does the following:
 Create a binary search tree from an array of random numbers < 100. You can create a function that returns an array of random numbers every time you call it, if you wish.
 Confirm that the tree is balanced by calling
isBalanced
.  Print out all elements in level, pre, post, and in order.
 Unbalance the tree by adding several numbers > 100.
 Confirm that the tree is unbalanced by calling
isBalanced
.  Balance the tree by calling
rebalance
.  Confirm that the tree is balanced by calling
isBalanced
.  Print out all elements in level, pre, post, and in order.
Additional resources
This section contains helpful links to related content. It isn’t required, so consider it supplemental.
 Yicheng Gong has some excellent videos that help visualize the call stack when traversing binary search trees: Inorder, Postorder, and Preorder Traversal Algorithms.