Sure, it’s the binary tree equivalent of reversing an array.

For large enough trees it's probably more efficient to instead just switch from preorder to postorder traversal instead of changing the whole tree.