yige/js-practice
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

Compare commits

base: yige:450f1f6b5d96df43627b7b8c07518b2ec772a2da
Branches Tags
yige:master
...
compare: yige:7f6439ce7c95dbfb3ac69c51e16de5a6e279d55c
Branches Tags
yige:master

3 Commits
450f1f6b5d ... 7f6439ce7c

Author SHA1 Message Date
yi-ge
7f6439ce7c add: 将有序数组转换为二叉搜索树 2020-07-06 11:41:53 +08:00
yi-ge
41aa639602 add: 将有序数组转换为二叉搜索树 2020-07-06 10:59:54 +08:00
yi-ge
146b33a651 add: 将有序数组转换为二叉搜索树 2020-07-06 10:59:02 +08:00
2 changed files with 5 additions and 1 deletions
Show Stats Expand all files Collapse all files

4
src/tree/convert-sorted-array-to-binary-search-tree.js
View File

@ -1,3 +1,6 @@
<<<<<<< HEAD
import TreeNode from '../../test/tree/TreeNode'
=======
/**
* Definition for a binary tree node.
*/
@ -6,6 +9,7 @@ function TreeNode(val) {
this.left = this.right = null
}
>>>>>>> 450f1f6b5d96df43627b7b8c07518b2ec772a2da
/**
* @param {number[]} nums
* @return {TreeNode}

2
test/tree/convert-sorted-array-to-binary-search-tree.test.js
View File

@ -1,5 +1,5 @@
import { sortedArrayToBST } from '../../src/tree/convert-sorted-array-to-binary-search-tree.js'
test('将有序数组转换为二叉搜索树', () => {
expect(sortedArrayToBST()).toEqual()
expect(sortedArrayToBST([-10, -3, 0, 5, 9])).toEqual({ left: { left: null, right: { left: null, right: null, val: -3 }, val: -10 }, right: { left: null, right: { left: null, right: null, val: 9 }, val: 5 }, val: 0 })
})