title: Function To Determine If Binary Tree Leaves Are Maxima In Path
body: <p>I have a challenging task to solve. I've got a binary tree, like this one: the root is 11, the children of 11 are 5 and 8, the children of 5 are 13 and 12, the right child of 8 is 14.</p>
  
  <p>I have to write a function that looks at all the leaves, and returns true, if the leaf is the maximum in the path leading from the root to the leaf, and false if that is not the case. So, e.g. for leaf 14, this is obviously true, because from the root (11), there is one node (5), and 14 is the maximum of these.</p>
  
  <p>I know that this has to be a recursive function, but I don't really have an idea how to tackle this. An explanation in Python, Java, C or Pascal would be great, but I'd already be happy if someone could just give me a hint how to solve this.</p>
  
  <p>Thanks :)</p>