Cracking The Coding Interview/Q 4.9

From Software Engineers Wiki
Jump to: navigation, search

You are given a binary tree in which each node contains a value. Design an algorithm to print all paths which sum to a given value. The path does not need to start or end at the root or a leaf

Answer

Personal tools
Namespaces

Variants
Actions
Navigation
Toolbox