@kevinwin/

minimalTree

Jest

Given a sorted (increasing order) array with unique integer elements, write an algorithm to create a binary search tree with minimal height.

fork
loading
languages
header iconstalk
Files
  • config.json
  • Tree.js
  • minimalTree.js
  • minimalTree.test.js
config.json
1
2
3
4
5

{
  "testRegex": ".*\\.test\\.js$",
  "testEnvironment": "node"
}