Description: // You are given a binary tree in which each node contains a value Design a lgorithm to print all paths which sum up to that value Note that it can be any path in the tree-.. It does not have to start at the root // Given a binary tree, each node contains a value. Print out all the following conditions are met path: the path to the node values add up to a given value. Note: These paths do not have to start the root. Scenario 1: If the node contains a pointer pointing to the father node, then just go to traverse the binary tree, and then start each node to constantly tired, plus the value of its parent node until the father node empty (this is unique, because each node has only one parent node. It is because of this uniqueness, can not otherwise open additional space to store the path), if the value is equal to a given sum, the printout . Scenario 2: If the node does not contain a pointer pointing to the father node, then the binary search path down the process, t
To Search:
File list (Check if you may need any files):
Q4.8
....\.DS_Store
__MACOSX
........\Q4.8
........\....\._.DS_Store
Q4.8\Q4.8
....\....\.DS_Store
__MACOSX\Q4.8\Q4.8
........\....\....\._.DS_Store
Q4.8\Q4.8\main.cpp
__MACOSX\Q4.8\Q4.8\._main.cpp
Q4.8\Q4.8\Q4_8.1
__MACOSX\Q4.8\Q4.8\._Q4_8.1
Q4.8\Q4.8.xcodeproj
....\..............\project.pbxproj
....\..............\project.xcworkspace
....\..............\...................\contents.xcworkspacedata
....\..............\...................\xcuserdata
....\..............\...................\..........\mac.xcuserdatad
....\..............\...................\..........\...............\UserInterfaceState.xcuserstate
....\..............\xcuserdata
....\..............\..........\mac.xcuserdatad
....\..............\..........\...............\xcschemes
....\..............\..........\...............\.........\Q4.8.xcscheme
....\..............\..........\...............\.........\xcschememanagement.plist
Download