1 / \ 2 3 / \ 4 5 / / \ 6 7 8
node * root = newNode ( 1 ) ; root -> left = newNode ( 2 ) ; root -> right = newNode ( 3 ) ; root -> right -> left = newNode ( 4 ) ; root -> right -> right = newNode ( 5 ) ; root -> right -> left -> left = newNode ( 6 ) ; root -> right -> right -> left = newNode ( 7 ) ; root -> right -> right -> right = newNode ( 8 ) ; convert ( root ) ; cout << " Traversal ▁ of ▁ the ▁ tree ▁ converted ▁ to ▁ down - right ▁ form STRNEWLINE " ; downRightTraversal ( root ) ; return 0 ; }