Skip to content

Commit 4ff28b9

Browse files
committed
πŸ“œ Update README table (πŸ› οΈ from Github Actions)
1 parent 66292aa commit 4ff28b9

File tree

1 file changed

+1
-1
lines changed

1 file changed

+1
-1
lines changed

β€ŽREADME.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -258,7 +258,7 @@ If you would like to have collaborator permissions on the repo to merge your own
258258
<sub>[0513 - Find Bottom Left Tree Value](https://leetcode.com/problems/find-bottom-left-tree-value/)</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%2F0513-find-bottom-left-tree-value.java)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[βœ”οΈ](kotlin%2F0513-find-bottom-left-tree-value.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>
259259
<sub>[0669 - Trim a Binary Search Tree](https://leetcode.com/problems/trim-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'>[βœ”οΈ](go%2F0669-trim-a-binary-search-tree.go)</div></sub> | <sub><div align='center'>[βœ”οΈ](java%2F0669-trim-a-binary-search-tree.java)</div></sub> | <sub><div align='center'>[βœ”οΈ](javascript%2F0669-trim-a-binary-search-tree.js)</div></sub> | <sub><div align='center'>[βœ”οΈ](kotlin%2F0669-trim-a-binary-search-tree.kt)</div></sub> | <sub><div align='center'>[βœ”οΈ](python%2F0669-trim-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'>[βœ”οΈ](typescript%2F0669-trim-a-binary-search-tree.ts)</div></sub>
260260
<sub>[0173 - Binary Search Tree Iterator](https://leetcode.com/problems/binary-search-tree-iterator/)</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%2F0173-binary-search-tree-iterator.java)</div></sub> | <sub><div align='center'>[βœ”οΈ](javascript%2F0173-binary-search-tree-iterator.js)</div></sub> | <sub><div align='center'>[βœ”οΈ](kotlin%2F0173-binary-search-tree-iterator.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>
261-
<sub>[0538 - Convert Bst to Greater Tree](https://leetcode.com/problems/convert-bst-to-greater-tree/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[βœ”οΈ](cpp%2F0538-convert-bst-to-greater-tree.cpp)</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>
261+
<sub>[0538 - Convert Bst to Greater Tree](https://leetcode.com/problems/convert-bst-to-greater-tree/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[βœ”οΈ](cpp%2F0538-convert-bst-to-greater-tree.cpp)</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%2F0538-convert-bst-to-greater-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>
262262
<sub>[0124 - Binary Tree Maximum Path Sum](https://leetcode.com/problems/binary-tree-maximum-path-sum/)</sub> | <sub><div align='center'>[βœ”οΈ](c%2F0124-binary-tree-maximum-path-sum.c)</div></sub> | <sub><div align='center'>[βœ”οΈ](cpp%2F0124-binary-tree-maximum-path-sum.cpp)</div></sub> | <sub><div align='center'>[βœ”οΈ](csharp%2F0124-binary-tree-maximum-path-sum.cs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[βœ”οΈ](go%2F0124-binary-tree-maximum-path-sum.go)</div></sub> | <sub><div align='center'>[βœ”οΈ](java%2F0124-binary-tree-maximum-path-sum.java)</div></sub> | <sub><div align='center'>[βœ”οΈ](javascript%2F0124-binary-tree-maximum-path-sum.js)</div></sub> | <sub><div align='center'>[βœ”οΈ](kotlin%2F0124-binary-tree-maximum-path-sum.kt)</div></sub> | <sub><div align='center'>[βœ”οΈ](python%2F0124-binary-tree-maximum-path-sum.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[βœ”οΈ](rust%2F0124-binary-tree-maximum-path-sum.rs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[βœ”οΈ](swift%2F0124-binary-tree-maximum-path-sum.swift)</div></sub> | <sub><div align='center'>[βœ”οΈ](typescript%2F0124-binary-tree-maximum-path-sum.ts)</div></sub>
263263
<sub>[0297 - Serialize And Deserialize Binary Tree](https://leetcode.com/problems/serialize-and-deserialize-binary-tree/)</sub> | <sub><div align='center'>[βœ”οΈ](c%2F0297-serialize-and-deserialize-binary-tree.c)</div></sub> | <sub><div align='center'>[βœ”οΈ](cpp%2F0297-serialize-and-deserialize-binary-tree.cpp)</div></sub> | <sub><div align='center'>[βœ”οΈ](csharp%2F0297-serialize-and-deserialize-binary-tree.cs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[βœ”οΈ](go%2F0297-serialize-and-deserialize-binary-tree.go)</div></sub> | <sub><div align='center'>[βœ”οΈ](java%2F0297-serialize-and-deserialize-binary-tree.java)</div></sub> | <sub><div align='center'>[βœ”οΈ](javascript%2F0297-serialize-and-deserialize-binary-tree.js)</div></sub> | <sub><div align='center'>[βœ”οΈ](kotlin%2F0297-serialize-and-deserialize-binary-tree.kt)</div></sub> | <sub><div align='center'>[βœ”οΈ](python%2F0297-serialize-and-deserialize-binary-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'>[βœ”οΈ](swift%2F0297-serialize-and-deserialize-binary-tree.swift)</div></sub> | <sub><div align='center'>[βœ”οΈ](typescript%2F0297-serialize-and-deserialize-binary-tree.ts)</div></sub>
264264

0 commit comments

Comments
Β (0)