如何在TypeScript中创建递归二叉树？

class TreeNode {
  value: any;
  left: TreeNode | null;
  right: TreeNode | null;

  constructor(value: any) {
    this.value = value;
    this.left = null;
    this.right = null;
  }
}

function createBinaryTree(arr: any[]): TreeNode | null {
  if (arr.length === 0) {
    return null;
  }

  const rootValue = arr.shift();
  const rootNode = new TreeNode(rootValue);

  const leftArr: any[] = [];
  const rightArr: any[] = [];

  for (let i = 0; i < arr.length; i++) {
    if (arr[i] < rootValue) {
      leftArr.push(arr[i]);
    } else {
      rightArr.push(arr[i]);
    }
  }

  rootNode.left = createBinaryTree(leftArr);
  rootNode.right = createBinaryTree(rightArr);

  return rootNode;
}

const arr = [4, 2, 6, 1, 3, 5, 7];
const root = createBinaryTree(arr);
console.log(root);