st Search self.dfsHelper(root, 0, []) return self.minSumPath def dfsHelper(self, node: TreeNode, currentSum: int, currentPath: List[int]): currentSum += node.val currentPath.append(node.val) if node.left is None and node.right is None: if currentSum < self.minSumFound: self.minSumFound = currentSum self.minSumPath = list(currentPath) # Recurse if node.left: self.dfsHelper(node.left, currentSum, currentPath) if node.right: self.dfsHelper(node.right, currentSum, currentPath) # Backtrack currentPath.pop()1a:T60c,/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode() : val(0), left(nullptr), right(nullptr) {} * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {} * TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {} * }; */ #include #include #include #include using namespace std; class Solution { private: int minSumFound; vector minSumPath; public: vector findMinPath(TreeNode* root) { minSumFound = INT_MAX; minSumPath = {}; if (!root) { return {}; } // Start the recursive Depth First Search vector currentPath = {}; dfsHelper(root, 0, currentPath); return minSumPath; } void dfsHelper(TreeNode* node, int currentSum, vector& currentPath) { currentSum += node->val; currentPath.push_back(node->val); if (node->left == nullptr && node->right == nullptr) { if (currentSum < minSumFound) { minSumFound = currentSum; minSumPath = currentPath; } } // Recurse if (node->left) { dfsHelper(node->left, currentS

AI Assistant