title: Recursion in binary trees to return a bool value?
body: <p>I want to create a recursive function that takes a binary tree as its parameter and returns True if every leaf below a node is greater than its parent.  If just one node fails to meet this condition, the entire function should return False. </p>
  
  <p>However, I am struggling to come up with a base case, as well as fully understanding how to stop the function and return False if even just one part of the tree does not meet the condition.  Any help would be greatly appreciated.</p>