mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-08 00:41:42 +08:00
update
This commit is contained in:
@@ -161,7 +161,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"40.8K\", \"totalSubmission\": \"114.1K\", \"totalAcceptedRaw\": 40835, \"totalSubmissionRaw\": 114137, \"acRate\": \"35.8%\"}",
|
||||
"stats": "{\"totalAccepted\": \"40.8K\", \"totalSubmission\": \"114.1K\", \"totalAcceptedRaw\": 40836, \"totalSubmissionRaw\": 114138, \"acRate\": \"35.8%\"}",
|
||||
"hints": [
|
||||
"如果使用前序遍历来遍历树,元素的顺序是正确的,这是否表明树实际上是有序的?有重复元素会发生什么?如果允许重复元素,它们必须位于特定的一边(通常是左边)。",
|
||||
"作为一个二叉搜索树,并不是说每个节点都满足left.value <= current.value < right就够了。左边的每个节点必须小于当前节点,该节点还必须小于右边的所有节点。",
|
||||
|
Reference in New Issue
Block a user