Constructed binary tree is 1 / \ 5 8 / \ / \ 2 4 9 10
root = newnode ( 1 ) NEW_LINE root . left = newnode ( 5 ) NEW_LINE root . right = newnode ( 8 ) NEW_LINE root . left . left = newnode ( 2 ) NEW_LINE root . left . right = newnode ( 4 ) NEW_LINE root . right . left = newnode ( 9 ) NEW_LINE root . right . right = newnode ( 10 ) NEW_LINE sinkOddNodes ( root ) NEW_LINE print ( " Level ▁ order ▁ traversal ▁ of ▁ modified ▁ tree " ) NEW_LINE printLevelOrder ( root ) NEW_LINE