diff --git a/README.md b/README.md
index 4b1ef6760..943bad735 100644
--- a/README.md
+++ b/README.md
@@ -220,7 +220,7 @@ If you would like to have collaborator permissions on the repo to merge your own
[0094 - Binary Tree Inorder Traversal](https://leetcode.com/problems/binary-tree-inorder-traversal/) | [✔️](c%2F0094-binary-tree-inorder-traversal.c)
| [✔️](cpp%2F0094-binary-tree-inorder-traversal.cpp)
| [✔️](csharp%2F0094-binary-tree-inorder-traversal.cs)
| ❌
| [✔️](go%2F0094-binary-tree-inorder-traversal.go)
| [✔️](java%2F0094-binary-tree-inorder-traversal.java)
| [✔️](javascript%2F0094-binary-tree-inorder-traversal.js)
| [✔️](kotlin%2F0094-binary-tree-inorder-traversal.kt)
| [✔️](python%2F0094-binary-tree-inorder-traversal.py)
| [✔️](ruby%2F0094-binary-tree-inorder-traversal.rb)
| [✔️](rust%2F0094-binary-tree-inorder-traversal.rs)
| ❌
| [✔️](swift%2F0094-binary-tree-inorder-traversal.swift)
| [✔️](typescript%2F0094-binary-tree-inorder-traversal.ts)
[0144 - Binary Tree Preorder Traversal](https://leetcode.com/problems/binary-tree-preorder-traversal/) | ❌
| [✔️](cpp%2F0144-binary-tree-preorder-traversal.cpp)
| ❌
| ❌
| ❌
| ❌
| ❌
| [✔️](kotlin%2F0144-binary-tree-preorder-traversal.kt)
| [✔️](python%2F0144-binary-tree-preorder-traversal.py)
| ❌
| ❌
| ❌
| ❌
| [✔️](typescript%2F0144-binary-tree-preorder-traversal.ts)
[0145 - Binary Tree Postorder Traversal](https://leetcode.com/problems/binary-tree-postorder-traversal/) | ❌
| [✔️](cpp%2F0145-binary-tree-postorder-traversal.cpp)
| ❌
| ❌
| ❌
| [✔️](java%2F0145-binary-tree-postorder-traversal.java)
| ❌
| [✔️](kotlin%2F0145-binary-tree-postorder-traversal.kt)
| [✔️](python%2F0145-binary-tree-postorder-traversal.py)
| ❌
| ❌
| ❌
| ❌
| [✔️](typescript%2F0145-binary-tree-postorder-traversal.ts)
-[0226 - Invert Binary Tree](https://leetcode.com/problems/invert-binary-tree/) | [✔️](c%2F0226-invert-binary-tree.c)
| [✔️](cpp%2F0226-invert-binary-tree.cpp)
| [✔️](csharp%2F0226-invert-binary-tree.cs)
| ❌
| [✔️](go%2F0226-invert-binary-tree.go)
| [✔️](java%2F0226-invert-binary-tree.java)
| [✔️](javascript%2F0226-invert-binary-tree.js)
| [✔️](kotlin%2F0226-invert-binary-tree.kt)
| [✔️](python%2F0226-invert-binary-tree.py)
| [✔️](ruby%2F0226-invert-binary-tree.rb)
| ❌
| ❌
| [✔️](swift%2F0226-invert-binary-tree.swift)
| [✔️](typescript%2F0226-invert-binary-tree.ts)
+[0226 - Invert Binary Tree](https://leetcode.com/problems/invert-binary-tree/) | [✔️](c%2F0226-invert-binary-tree.c)
| [✔️](cpp%2F0226-invert-binary-tree.cpp)
| [✔️](csharp%2F0226-invert-binary-tree.cs)
| ❌
| [✔️](go%2F0226-invert-binary-tree.go)
| [✔️](java%2F0226-invert-binary-tree.java)
| [✔️](javascript%2F0226-invert-binary-tree.js)
| [✔️](kotlin%2F0226-invert-binary-tree.kt)
| [✔️](python%2F0226-invert-binary-tree.py)
| [✔️](ruby%2F0226-invert-binary-tree.rb)
| [✔️](rust%2F0226-invert-binary-tree.rs)
| ❌
| [✔️](swift%2F0226-invert-binary-tree.swift)
| [✔️](typescript%2F0226-invert-binary-tree.ts)
[0104 - Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree/) | [✔️](c%2F0104-maximum-depth-of-binary-tree.c)
| [✔️](cpp%2F0104-maximum-depth-of-binary-tree.cpp)
| [✔️](csharp%2F0104-maximum-depth-of-binary-tree.cs)
| ❌
| [✔️](go%2F0104-maximum-depth-of-binary-tree.go)
| [✔️](java%2F0104-maximum-depth-of-binary-tree.java)
| [✔️](javascript%2F0104-maximum-depth-of-binary-tree.js)
| [✔️](kotlin%2F0104-maximum-depth-of-binary-tree.kt)
| [✔️](python%2F0104-maximum-depth-of-binary-tree.py)
| [✔️](ruby%2F0104-maximum-depth-of-binary-tree.rb)
| [✔️](rust%2F0104-maximum-depth-of-binary-tree.rs)
| ❌
| [✔️](swift%2F0104-maximum-depth-of-binary-tree.swift)
| [✔️](typescript%2F0104-maximum-depth-of-binary-tree.ts)
[0543 - Diameter of Binary Tree](https://leetcode.com/problems/diameter-of-binary-tree/) | [✔️](c%2F0543-diameter-of-binary-tree.c)
| [✔️](cpp%2F0543-diameter-of-binary-tree.cpp)
| [✔️](csharp%2F0543-diameter-of-binary-tree.cs)
| ❌
| [✔️](go%2F0543-diameter-of-binary-tree.go)
| [✔️](java%2F0543-diameter-of-binary-tree.java)
| [✔️](javascript%2F0543-diameter-of-binary-tree.js)
| [✔️](kotlin%2F0543-diameter-of-binary-tree.kt)
| [✔️](python%2F0543-diameter-of-binary-tree.py)
| [✔️](ruby%2F0543-diameter-of-binary-tree.rb)
| [✔️](rust%2F0543-diameter-of-binary-tree.rs)
| ❌
| [✔️](swift%2F0543-diameter-of-binary-tree.swift)
| [✔️](typescript%2F0543-diameter-of-binary-tree.ts)
[0110 - Balanced Binary Tree](https://leetcode.com/problems/balanced-binary-tree/) | [✔️](c%2F0110-balanced-binary-tree.c)
| [✔️](cpp%2F0110-balanced-binary-tree.cpp)
| [✔️](csharp%2F0110-balanced-binary-tree.cs)
| ❌
| [✔️](go%2F0110-balanced-binary-tree.go)
| [✔️](java%2F0110-balanced-binary-tree.java)
| [✔️](javascript%2F0110-balanced-binary-tree.js)
| [✔️](kotlin%2F0110-balanced-binary-tree.kt)
| [✔️](python%2F0110-balanced-binary-tree.py)
| [✔️](ruby%2F0110-balanced-binary-tree.rb)
| [✔️](rust%2F0110-balanced-binary-tree.rs)
| ❌
| [✔️](swift%2F0110-balanced-binary-tree.swift)
| [✔️](typescript%2F0110-balanced-binary-tree.ts)