Constructed binary tree is 1 / \ 5 8 / \ / \ 2 4 9 10
Node * root = newnode ( 1 ) ; root -> left = newnode ( 5 ) ; root -> right = newnode ( 8 ) ; root -> left -> left = newnode ( 2 ) ; root -> left -> right = newnode ( 4 ) ; root -> right -> left = newnode ( 9 ) ; root -> right -> right = newnode ( 10 ) ; sinkOddNodes ( root ) ; printf ( " Level ▁ order ▁ traversal ▁ of ▁ modified ▁ tree STRNEWLINE " ) ; printLevelOrder ( root ) ; return 0 ; }