Thanks to visit codestin.com Credit goes to github.com
We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 945e7c3 commit 61f2d19Copy full SHA for 61f2d19
src/algorithms/tree/breadth-first-search/breadthFirstSearch.js
@@ -3,9 +3,9 @@ import Queue from '../../../data-structures/queue/Queue';
3
/**
4
* @typedef {Object} Callbacks
5
* @property {function(node: BinaryTreeNode, child: BinaryTreeNode): boolean} allowTraversal -
6
- * Determines whether DFS should traverse from the node to its child.
7
- * @property {function(node: BinaryTreeNode)} enterNode - Called when DFS enters the node.
8
- * @property {function(node: BinaryTreeNode)} leaveNode - Called when DFS leaves the node.
+ * Determines whether BFS should traverse from the node to its child.
+ * @property {function(node: BinaryTreeNode)} enterNode - Called when BFS enters the node.
+ * @property {function(node: BinaryTreeNode)} leaveNode - Called when BFS leaves the node.
9
*/
10
11
0 commit comments