1038. Binary Search Tree to Greater Sum Tree - English Version

preview_player
Показать описание
Рекомендации по теме
Convert BST to 0:09:33

Convert BST to Greater Tree - Leetcode 538 - Python

LeetCode #1038 - 0:07:03

LeetCode #1038 - Binary Search Tree to Greater Sum Tree

1038. Binary Search 0:11:09

1038. Binary Search Tree to Greater Sum Tree (Leetcode Medium)

Binary Search Tree 0:05:09

Binary Search Tree to Greater Sum Tree - Leetcode 1038 - Java

1038. Binary Search 0:05:48

1038. Binary Search Tree to Greater Sum Tree - English Version

1038. Binary Search 0:17:59

1038. Binary Search Tree to Greater Sum Tree

1038 Binary Search 0:08:47

1038 Binary Search Tree to Greater Sum Tree

1038 Binary Search 0:12:47

1038 Binary Search Tree to Greater Sum Tree

LeetCode 1038. Binary 0:15:19

LeetCode 1038. Binary Search Tree to Greater Sum Tree Solution Explained - Java

1038. Binary Search 0:34:27

1038. Binary Search Tree to Greater Sum Tree | Recursive | Iterative | Morris Traversal

LeetCode 1038. Binary 0:04:38

LeetCode 1038. Binary Search Tree to Greater Sum Tree solution with TypeScript & JavaScript

leetCode 1038 - 0:16:10

leetCode 1038 - Binary Search Tree to Greater Sum Tree | JSer - algorithm & JavaScript

LeetCode 1038 | 0:01:40

LeetCode 1038 | Binary Search Tree to Greater Sum Tree

LeetCode 1038 | 0:01:26

LeetCode 1038 | Binary Search Tree to Greater Sum Tree | Recursion | Java

leetcode 1038 Binary 0:14:26

leetcode 1038 Binary Search Tree to Greater Sum Tree BST, traversal

✅ Binary Search 0:08:09

✅ Binary Search Tree to Greater Sum Tree - LeetCode 1038 - Reverse Inorder Traversal - Explained

LeetCode | 1038 0:13:53

LeetCode | 1038 Binary Search Tree to Greater Sum Tree

LeetCode 1038 Binary 0:05:17

LeetCode 1038 Binary Search Tree to Greater Sum Tree

Leetcode 1038 Binary 0:04:18

Leetcode 1038 Binary Search Tree to Greater Sum Tree

1038. Binary Search 0:01:01

1038. Binary Search Tree to Greater Sum Tree #leetcode

Leetcode - Convert 0:04:07

Leetcode - Convert BST to Greater Tree (Python)

Binary Search Tree 0:27:38

Binary Search Tree to Greater Sum Tree | Brute | Better | Optimal | Leetcode 1038 | codestorywithMIK

1038. Binary Search 0:01:22

1038. Binary Search Tree to Greater Sum Tree #leetcode

1038. Binary Search 0:03:32

1038. Binary Search Tree to Greater Sum Tree (LeetCode, Java)

Комментарии
Автор

Thank you, this was a big help!! Note, if you remove the "nonlocal sum" line on line 12 and define sum as self.sum = 0 on line 10 instead, performance goes from "faster than ~38% to faster than 99%. This removes the redefinition of the sum variable in the function. Of course you need to change all the sum variables to self.sum. btw, this is probably the best python lesson on recursion on all of youtube.

bryandotmee
Автор

Really nice explanation of recursion. Finally got a grasp of the topic!

crystalzoya
Автор

Wish I was as quick as you with recursion. Very nicely solved

abdullahfaizurrahman
Автор

DFS iterative solution:

def bstToGst(self, root: TreeNode) -> TreeNode:
total = 0
def dfs(root):
nonlocal total
if not root:
return root

stack = []
while stack or root:
while root:
stack.append(root)
root = root.right

root = stack.pop()
total += root.val
root.val = total
root = root.left
dfs(root)
return root

abdifatahmoh
Автор

class Solution:
def bstToGst(self, root: TreeNode) -> TreeNode:
running_sum = 0
def helper(node):
nonlocal running_sum
if not node: return 0
helper(node.right)
running_sum += node.val
node.val = running_sum
helper(node.left)
helper(root)
return root

Runtime: 40 ms, faster than 24.27% of Python3 online submissions for Binary Search Tree to Greater Sum Tree.
Memory Usage: 13.8 MB, less than 78.13% of Python3 online submissions for Binary Search Tree to Greater Sum Tree.

aunnfriends