Breadth First Search

Traverses a tree level by level using a queue.

Interactive Visualization

Loading visualization…

Usage

src/sample/bfs.ts

import { bfs, Node } from 'athro';

const root = new Node(3);
const result = bfs(root);