{"size": 214, "ext": "js", "max_stars_repo_path": "data-structure-and-algorithm/code/leetcode/src/binarySearchTree/sortedArrayToBST.test.js", "max_stars_repo_name": "negrochn/study-juejin", "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "data-structure-and-algorithm/code/leetcode/src/binarySearchTree/sortedArrayToBST.test.js", "max_issues_repo_name": "negrochn/study-juejin", "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "data-structure-and-algorithm/code/leetcode/src/binarySearchTree/sortedArrayToBST.test.js", "max_forks_repo_name": "negrochn/study-juejin", "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null}
{"max_stars_count": null, "max_issues_count": null, "max_forks_count": null, "avg_line_length": 35.6666666667, "max_line_length": 97, "alphanum_fraction": 0.6355140187}
import sortedArrayToBST from './sortedArrayToBST'
import Tree from './tree'

test('sortedArrayToBST', () => {
  expect(sortedArrayToBST([-10, -3, 0, 5, 9])).toEqual(new Tree([0, -3, 9, -10, null, 5, null]))
})