From 07eef8d896876e2f87e853626a74a2a5957cb987 Mon Sep 17 00:00:00 2001 From: Bot-A0 <71089234+Ahmad-A0@users.noreply.github.com> Date: Fri, 30 Sep 2022 08:40:28 +0000 Subject: [PATCH] =?UTF-8?q?=F0=9F=93=9C=20Update=20README=20table=20(?= =?UTF-8?q?=F0=9F=9B=A0=EF=B8=8F=20from=20Github=20Actions)?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index 39129e534..3a0359da8 100644 --- a/README.md +++ b/README.md @@ -85,7 +85,7 @@ If you would like to have collaborator permissions on the repo to merge your own [102 - Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal/) |
|
✔️
|
✔️
|
✔️
|
✔️
|
✔️
|
✔️
|
✔️
|
|
|
|
✔️
|
✔️
[199 - Binary Tree Right Side View](https://leetcode.com/problems/binary-tree-right-side-view/) |
✔️
|
✔️
|
✔️
|
|
✔️
|
✔️
|
✔️
|
✔️
|
|
|
|
✔️
|
✔️
[1448 - Count Good Nodes in a Binary Tree](https://leetcode.com/problems/count-good-nodes-in-binary-tree/) |
✔️
|
✔️
|
✔️
|
✔️
|
✔️
|
✔️
|
✔️
|
✔️
|
|
|
|
✔️
|
✔️
-[98 - Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree/) |
✔️
|
✔️
|
✔️
|
|
✔️
|
✔️
|
✔️
|
✔️
|
|
|
|
✔️
|
✔️
+[98 - Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree/) |
✔️
|
✔️
|
✔️
|
✔️
|
✔️
|
✔️
|
✔️
|
✔️
|
|
|
|
✔️
|
✔️
[230 - Kth Smallest Element in a BST](https://leetcode.com/problems/kth-smallest-element-in-a-bst/) |
|
✔️
|
✔️
|
|
✔️
|
✔️
|
✔️
|
✔️
|
|
|
|
✔️
|
✔️
[105 - Construct Tree from Preorder and Inorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/) |
|
✔️
|
|
|
✔️
|
✔️
|
✔️
|
✔️
|
|
|
|
|
✔️
[124 - Binary Tree Max Path Sum](https://leetcode.com/problems/binary-tree-maximum-path-sum/) |
✔️
|
✔️
|
✔️
|
✔️
|
✔️
|
✔️
|
✔️
|
✔️
|
|
|
|
✔️
|
✔️