3 ms·
If you implement a fixed size binary tree as an array, breadth first search is simply iterating over its elements.
by extasia 4y ago
If you implement a fixed size binary tree as an array, breadth first search is simply iterating over its elements.