README.md

Trees

Challenge

Create a Binary Tree Class with preOrder, inOrder, postOrder, breadthFirst and max methods. Create a Binary Search Tree that extends the Binary Tree Class with _add and _contains methods.

Approach & Efficiency Binary Tree

Method	Time Complexity
preOrder	O(n)
inOrder	O(n)
postOrder	O(n)
max	O(n)
breadthFirst	O(n)
fizzBuzz	O(n)

Approach & Efficiency Binary Search Tree

Method	Time Complexity
_add	O(h)
_contains	O(n)

Methods

_add

• Adds a new node with that value in the correct location in the binary search tree.

_contains

• Returns a boolean indicating whether or not the value is in the tree.

max

• Returns the max value found in a binary tree.

breadthFirst

• Returns all the values of the nodes as in the order encountered from a breadth first traversal.

fizzBuzz

• Returns a copy of the tree with the values following the rules:
  • If the value is divisible by 3, replace the value with “Fizz”
  • If the value is divisible by 5, replace the value with “Buzz”
  • If the value is divisible by 3 and 5, replace the value with “FizzBuzz”
  • If the value is not divisible by 3 or 5, simply turn the number into a String.

Run Solution

# Install dependencies
npm install

# run jest tests for binary-tree and binary-search-tree
npm test binary-tree.test.js binary-search-tree.test.js

Sources

Spread Syntax