coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-09 09:21:40 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2023-12-09 19:57:46 +08:00
parent 9bc4722a45
commit 3770b44d1e
4792 changed files with 10889 additions and 10886 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
leetcode-cn/originData/check-subtree-lcci.json
View File

@@ -167,7 +167,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"28.4K\", \"totalSubmission\": \"43.1K\", \"totalAcceptedRaw\": 28432, \"totalSubmissionRaw\": 43064, \"acRate\": \"66.0%\"}",
"stats": "{\"totalAccepted\": \"28.4K\", \"totalSubmission\": \"43.1K\", \"totalAcceptedRaw\": 28433, \"totalSubmissionRaw\": 43070, \"acRate\": \"66.0%\"}",
"hints": [
"如果T2是T1的子树，它的中序遍历将如何与T1的比较？它的前序和后序遍历如何？",
"中序遍历无法告诉我们更多。毕竟，每个具有相同值的二叉搜索树（不管结构如何）将具有相同的中序遍历。这也就是中序遍历的含义：内容是有序的（如果它在二叉搜索树这种特定情况下不起作用，那么对于一般二叉树来说它肯定不起作用）。然而，前序遍历更具指示性。",