Constructed binary tree is 10 / \ 8 2 / \ / 3 5 2 \ 1 / 9
Node root = newNode ( 10 ) ; root . left = newNode ( 8 ) ; root . right = newNode ( 2 ) ; root . left . left = newNode ( 3 ) ; root . left . right = newNode ( 5 ) ; root . right . left = newNode ( 2 ) ; root . right . left . right = newNode ( 1 ) ; root . right . left . right . left = newNode ( 9 ) ; System . out . print ( findMaxBends ( root ) - 1 ) ; } }