@kevinwin/minimalTree
Given a sorted (increasing order) array with unique integer elements, write an algorithm to create a binary search tree with minimal height.
fork
loading
Files
- config.json
- Tree.js
- minimalTree.js
- minimalTree.test.js
config.json
Not sure what to do? Run some examples (start typing to dismiss)
1
Jest v22.1.2 node v7.4.0 linux/amd64