We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 2ec7fe2 commit ebd6ffdCopy full SHA for ebd6ffd
src/algorithms/tree/breadth-first-search/__test__/breadthFirstSearch.test.js
@@ -2,7 +2,7 @@ import BinaryTreeNode from '../../../../data-structures/tree/BinaryTreeNode';
2
import breadthFirstSearch from '../breadthFirstSearch';
3
4
describe('breadthFirstSearch', () => {
5
- it('should perform DFS operation on tree', () => {
+ it('should perform BFS operation on tree', () => {
6
const nodeA = new BinaryTreeNode('A');
7
const nodeB = new BinaryTreeNode('B');
8
const nodeC = new BinaryTreeNode('C');
0 commit comments