You can add a code that uses BFS to traverse a Graph. Use language other than c++.

You can add a code that uses string functions like string concatenation, copying a string etc.

I want to add Lowest Common Ancestor Problem in Binary Tree
Please assign it to me

You can add operations on and working of queue data structure.

You can submit a code that uses DFS to traverse a graph. C++ code has already been added. Try another language.

Through this algorithm, prime numbers upto a given target can be found in O(nlog(log(n)))
Example: n=16
Output: 2 3 5 7 11 13