擅长:python、mysql、java
<p>在这种情况下,我认为您要搜索的内容如下:</p>
<pre><code>def doesSumExist(startNode, sumTarget, currentSum):
totalSum = currentSum
if startNode is not Null:
if totalSum + startNode.value == sumTarget: #If this node completes the sum
return True
else: #if not
totalSum += startNode.value #increase current sum
if doesSumExist(startNode.left, sumTarget, totalSum): #recursive starting on the left children
return True
elif doesSumExist(startNode.right, sumTarget, totalSum): #recursive starting on the right children
return True
return False #if the sum is not present (starting in startNode).
</code></pre>
<p>但是,这不会检查任何连续的节点组合是否包含总和(代码将更加复杂)。在</p>
<p>希望这有帮助</p>