Added Breadth First Tree Traversal

[Dalfonso06]

Breadth First Tree traversal uses the breadth first algorithm to traverse through binary trees which can be used for algorithms such as level-order traversal and finding the deepest node of a binary tree with a time complexity of O(n) and space complexity of O(w) where w is the maximum width of the tree.

• I have performed a self-review of my code
• My code follows the style guidelines of this project
• I have added tests that prove my fix is effective or that my feature works
• New and existing unit tests pass locally with my changes
• Comments in areas I changed are up to date
• I have added comments to hard-to-understand areas of my code
• I have made corresponding changes to the README.md

[codecov]

Codecov Report

Base: 95.72% // Head: 95.75% // Increases project coverage by +0.02% 🎉

Coverage data is based on head (d892c66) compared to base (8b49dce).
Patch coverage: 100.00% of modified lines in pull request are covered.

Additional details and impacted files

@@            Coverage Diff             @@
##           master     #364      +/-   ##
==========================================
+ Coverage   95.72%   95.75%   +0.02%     
==========================================
  Files         217      218       +1     
  Lines        8827     8874      +47     
==========================================
+ Hits         8450     8497      +47     
  Misses        377      377              

Impacted Files	Coverage Δ
Algorithms/Graph/BreadthFirstTreeTraversal.cs	100.00% <100.00%> (ø)
...ataStructures/BinarySearchTree/BinarySearchTree.cs	100.00% <100.00%> (ø)

Help us with your feedback. Take ten seconds to tell us how you rate us. Have a feature suggestion? Share it here.

☔ View full report at Codecov.
📢 Do you have feedback about the report comment? Let us know in this issue.

[siriak]

Looks good, thanks!