12345678910111213141516171819202122232425262728293031323334353637383940
import { TreeNode } from "../binary-tree-inorder-traversal/TreeNode.ts";import { bigintMax } from "./bigint_max.ts";import { bigintMin } from "./bigint_min.ts";
export default function widthOfBinaryTree(root: TreeNode | null): number {    if (!root) return 0;    let current: Map<bigint, TreeNode> = new Map([[BigInt(0), root]]);
    let max_width = 1;
    while (true) {        const latest: Map<bigint, TreeNode> = new Map();        for (const [key, value] of current) {            const left = value?.left;            const right = value?.right;            if (left) {                latest.set(BigInt(key * 2n), left);            }            if (right) {                latest.set(BigInt(key * 2n + 1n), right);            }        }
        if (latest.size) {            current = latest;
            max_width = Math.max(                max_width,                Number(                    1n +                        bigintMax(...latest.keys()) -                        bigintMin(...latest.keys()),                ),            );        } else break;    }
    return max_width;}