We should be able to run through that method recursively, and check every subtree. Is that enough though? Let's extend our tree a bit and add two more children to the root's left child.

xxxxxxxxxx

/*

​

    5 

   / \ 

  3   9 

 / \

2   8

​

*/