Thanks to visit codestin.com Credit goes to github.com
We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
2 parents 82fdca2 + 478c78a commit e953eceCopy full SHA for e953ece
thinkings/tree.md
@@ -1403,10 +1403,10 @@ def bstFromPreorder(self, preorder: List[int]) -> TreeNode:
1403
mid = i
1404
break
1405
if mid == -1:
1406
- return None
1407
-
1408
- root.left = dfs(start + 1, mid - 1)
1409
- root.right = dfs(mid, end)
+ root.left = dfs(start + 1, end)
+ else:
+ root.left = dfs(start + 1, mid - 1)
+ root.right = dfs(mid, end)
1410
return root
1411
1412
return dfs(0, len(preorder) - 1)
0 commit comments