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 })
 })