Here's a classic example of inverting a binary tree (swap left and right children at every node): Original: 4 / \ 2 7 / \ / \ 1 3 6 9 Inverted: 4 / \ 7 2 / \ / \ 9 6 3 1 The algorithm is recursive: at ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results