From 41aa639602b09494e999213bc8b4efccb4e6eaba Mon Sep 17 00:00:00 2001 From: yi-ge Date: Mon, 6 Jul 2020 08:05:15 +0800 Subject: [PATCH] =?UTF-8?q?add:=20=E5=B0=86=E6=9C=89=E5=BA=8F=E6=95=B0?= =?UTF-8?q?=E7=BB=84=E8=BD=AC=E6=8D=A2=E4=B8=BA=E4=BA=8C=E5=8F=89=E6=90=9C?= =?UTF-8?q?=E7=B4=A2=E6=A0=91?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- src/tree/convert-sorted-array-to-binary-search-tree.js | 9 +-------- .../convert-sorted-array-to-binary-search-tree.test.js | 2 +- 2 files changed, 2 insertions(+), 9 deletions(-) diff --git a/src/tree/convert-sorted-array-to-binary-search-tree.js b/src/tree/convert-sorted-array-to-binary-search-tree.js index 0705a8a..b6b653b 100644 --- a/src/tree/convert-sorted-array-to-binary-search-tree.js +++ b/src/tree/convert-sorted-array-to-binary-search-tree.js @@ -1,11 +1,4 @@ -/** - * Definition for a binary tree node. - */ -function TreeNode(val) { - this.val = val - this.left = this.right = null -} - +import TreeNode from '../../test/tree/TreeNode' /** * @param {number[]} nums * @return {TreeNode} diff --git a/test/tree/convert-sorted-array-to-binary-search-tree.test.js b/test/tree/convert-sorted-array-to-binary-search-tree.test.js index 4153faa..0df2006 100644 --- a/test/tree/convert-sorted-array-to-binary-search-tree.test.js +++ b/test/tree/convert-sorted-array-to-binary-search-tree.test.js @@ -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 }) })