coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-25 14:58:56 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-03-29 16:56:27 +08:00
parent e730aa6794
commit ad15da05aa
2517 changed files with 7358 additions and 7332 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

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