We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 98ba1e1 commit 01b318aCopy full SHA for 01b318a
docs/gettingstarted/glossary/glossary.md
@@ -40,9 +40,9 @@ The height of the tree is 3.
40
41
There are two types of tree traversal, Depth-First Search (DFS) and Breadth-First Search (BFS).
42
43
-- **Depth-First Search* starts at the root and explores each branch to its leaf node before
+- **Depth-First Search** starts at the root and explores each branch to its leaf node before
44
moving to the next branch
45
-- **Breadth-First Search* starts at the root and explores every child node, and recursively
+- **Breadth-First Search** starts at the root and explores every child node, and recursively
46
does so for every node
47
48
### Pre-Order Traversal
0 commit comments