1 / 4 \ 6 / \ 8 9 / \ 12 10
Node root = newNode ( 1 ) ; root . left = newNode ( 4 ) ; root . left . right = newNode ( 6 ) ; root . left . right . left = newNode ( 8 ) ; root . left . right . right = newNode ( 9 ) ; root . left . right . left . left = newNode ( 12 ) ; root . left . right . right . right = newNode ( 10 ) ; if ( isSorted ( root ) == 1 ) Console . WriteLine ( " Sorted " ) ; else Console . WriteLine ( " Not ▁ sorted " ) ; } }