We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent eff500c commit 2e7071dCopy full SHA for 2e7071d
README.md
@@ -316,8 +316,6 @@ Example: Suppose you have given a tree structure and asked to calculate the aver
316
- **Space Complexity**: `O(n logn)`
317
- Use `Queue` while coding.
318
319
-
320
-
321
- [Breadth-first Traversal Question](https://codepen.io/roopkt/pen/bGqjVZe?editors=0010)
322
- [Breadth-first Traversal Answer](https://codepen.io/roopkt/pen/XWMBdWv?editors=0010)
323
0 commit comments