10 / \ 28 13 / \ 14 15 / \ 23 24 Let us create Binary Tree shown in above example
Node root = newNode ( 10 ) ; root . left = newNode ( 28 ) ; root . right = newNode ( 13 ) ; root . right . left = newNode ( 14 ) ; root . right . right = newNode ( 15 ) ; root . right . right . left = newNode ( 23 ) ; root . right . right . right = newNode ( 24 ) ; Console . WriteLine ( deepestOddLevelDepth ( root ) ) ; } }