Function buildTree

website/src/components/PRReviewer.tsx:201–235

(files: string[])

}

function buildTree(files: string[]): TreeNode[] {
  const root: TreeNode[] = [];

  for (const filePath of files) {
    const parts = filePath.split('/').filter(Boolean);
    let current = root;

    for (let i = 0; i < parts.length; i++) {
      const part = parts[i];
      const isLast = i === parts.length - 1;
      // For leaf nodes (files) we MUST store the original full path from data.files,
      // otherwise onFileClick won't match `n.file === path` in the graph data.
      const nodePath = isLast ? filePath : parts.slice(0, i + 1).join('/');

      let node = current.find(n => n.name === part);
      if (!node) {
        node = { name: part, path: nodePath, isDir: !isLast, children: [] };
        current.push(node);
      }
      current = node.children;
    }
  }

  // Sort: folders first, then files, each alphabetically
  const sortNodes = (nodes: TreeNode[]): TreeNode[] =>
    nodes
      .sort((a, b) => {
        if (a.isDir && !b.isDir) return -1;
        if (!a.isDir && b.isDir) return 1;
        return a.name.localeCompare(b.name);
      })
      .map(n => ({ ...n, children: sortNodes(n.children) }));

  return sortNodes(root);
}

// ─── Tree Item ────────────────────────────────────────────────────────────────
function TreeItem({