📜 Update README table (🛠️ from Github Actions)

Author: Ahmad-A0

README.md

@@ -204,7 +204,7 @@ If you would like to have collaborator permissions on the repo to merge your own
 <sub>[0108 - Convert Sorted Array to Binary Search Tree](https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/)</sub> | <sub><div align='center'>[✔️](c%2F0108-convert-sorted-array-to-binary-search-tree.c)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F0108-convert-sorted-array-to-binary-search-tree.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0108-convert-sorted-array-to-binary-search-tree.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0108-convert-sorted-array-to-binary-search-tree.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0108-convert-sorted-array-to-binary-search-tree.kt)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub>
 <sub>[0617 - Merge Two Binary Trees](https://leetcode.com/problems/merge-two-binary-trees/)</sub> | <sub><div align='center'>[✔️](c%2F0617-merge-two-binary-trees.c)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](dart%2F0617-merge-two-binary-trees.dart)</div></sub> | <sub><div align='center'>[✔️](go%2F0617-merge-two-binary-trees.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0617-merge-two-binary-trees.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0617-merge-two-binary-trees.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0617-merge-two-binary-trees.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0617-merge-two-binary-trees.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub>
 <sub>[0112 - Path Sum](https://leetcode.com/problems/path-sum/)</sub> | <sub><div align='center'>[✔️](c%2F0112-path-sum.c)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](csharp%2F0112-path-sum.cs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F0112-path-sum.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0112-path-sum.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0112-path-sum.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0112-path-sum.kt)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](swift%2F0112-path-sum.swift)</div></sub> | <sub><div align='center'>❌</div></sub>
-<sub>[0606 - Construct String From Binary Tree](https://leetcode.com/problems/construct-string-from-binary-tree/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub>
+<sub>[0606 - Construct String From Binary Tree](https://leetcode.com/problems/construct-string-from-binary-tree/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](java%2F0606-construct-string-from-binary-tree.java)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub>
 <sub>[0235 - Lowest Common Ancestor of a Binary Search Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/)</sub> | <sub><div align='center'>[✔️](c%2F0235-lowest-common-ancestor-of-a-binary-search-tree.c)</div></sub> | <sub><div align='center'>[✔️](cpp%2F0235-lowest-common-ancestor-of-a-binary-search-tree.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F0235-lowest-common-ancestor-of-a-binary-search-tree.cs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F0235-lowest-common-ancestor-of-a-binary-search-tree.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0235-lowest-common-ancestor-of-a-binary-search-tree.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0235-lowest-common-ancestor-of-a-binary-search-tree.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0235-lowest-common-ancestor-of-a-binary-search-tree.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0235-lowest-common-ancestor-of-a-binary-search-tree.py)</div></sub> | <sub><div align='center'>[✔️](ruby%2F0235-lowest-common-ancestor-of-a-binary-search-tree.rb)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](scala%2F0235-lowest-common-ancestor-of-a-binary-search-tree.scala)</div></sub> | <sub><div align='center'>[✔️](swift%2F0235-lowest-common-ancestor-of-a-binary-search-tree.swift)</div></sub> | <sub><div align='center'>[✔️](typescript%2F0235-lowest-common-ancestor-of-a-binary-search-tree.ts)</div></sub>
 <sub>[0701 - Insert into a Binary Search Tree](https://leetcode.com/problems/insert-into-a-binary-search-tree/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0701-insert-into-a-binary-search-tree.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0701-insert-into-a-binary-search-tree.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub>
 <sub>[0450 - Delete Node in a BST](https://leetcode.com/problems/delete-node-in-a-bst/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0450-delete-node-in-a-bst.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0450-delete-node-in-a-bst.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub>