coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-25 06:48:57 +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/legal-binary-search-tree-lcci.json
View File

@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"30.3K\", \"totalSubmission\": \"85.9K\", \"totalAcceptedRaw\": 30268, \"totalSubmissionRaw\": 85898, \"acRate\": \"35.2%\"}",
"stats": "{\"totalAccepted\": \"30.3K\", \"totalSubmission\": \"86.1K\", \"totalAcceptedRaw\": 30337, \"totalSubmissionRaw\": 86077, \"acRate\": \"35.2%\"}",
"hints": [
"如果使用前序遍历来遍历树，元素的顺序是正确的，这是否表明树实际上是有序的？有重复元素会发生什么？如果允许重复元素，它们必须位于特定的一边（通常是左边）。",
"作为一个二叉搜索树，并不是说每个节点都满足left.value <= current.value < right就够了。左边的每个节点必须小于当前节点，该节点还必须小于右边的所有节点。",