title: Algorithm to print all paths with a given sum in a binary tree
body: <p>The following is an interview question.</p>
  
  <blockquote>
    <p>You are given a binary tree (not necessarily BST) in which each node contains a value.
    Design an algorithm 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.</p>
  </blockquote>
  
  <p>Although I am able to find all paths in tree that start at the root have the given sum, I am not able to do so for paths not not starting at the root. </p>