binary tree implementation so you can win those code interviews 😎

binary-tree.ts

import y from "yaml";

export class TreeNode<T> {
  public readonly left?: TreeNode<T>;
  public readonly right?: TreeNode<T>;
  public readonly value: T;

  constructor(
    value: T,
    left?: TreeNode<T>,
    right?: TreeNode<T>
  ) {
    this.value = value;
    this.left = left;
    this.right = right;
  }

  toString(): string {
    return y.stringify({
      left: this.left?.toString() ?? null,
      right: this.right?.toString() ?? null,
      value: this.value,
    });
  }

  public static invert<T>(
    tree: TreeNode<T>
  ): TreeNode<T> {
    const left =
      tree.right && TreeNode.invert(tree.right);

    const right =
      tree.left && TreeNode.invert(tree.left);

    return new TreeNode(tree.value, left, right);
  }
}