Code challenge - BST

Summary

Your company needs you to implement a Binary Search Tree (BST), using the language of your choice. Your solution will be utilized by several different teams throughout your organization. Initially, this BST only needs to support integers.

Requirements:

The BST must be built from a list of integers.

Implement a method that returns the deepest nodes in the BST along with their depth

Example:

Input: 12,11,90,82,7,9 Output: deepest, 9; depth, 3

What we are looking for:

Correctness - will your solution produce the desired results?

Conciseness - does your solution balance clarity and brevity?

Maintainability - does your code stand up to changing needs?

Anti-patterns - does your solution avoid anti-patterns?

Testing

docker-compose up

Test coverage report:

open ./cover/index.html

Tasks

local repo

Github repo

Insert w/duplicate

Edge case - empty tree

Edge case - duplicate numbers

Use key/value in tree

Search for element

Insert wo/duplicate

Dockerfile

README

Tests setup

Input variable number of integers

Logging

Node class

Output depth

Output deepest nodes

Construct

Insert

Visitor - stdout

Visitor - depth

Visitor - deepest

Visitor - search

WAIT Delete node