/* * Copyright (c) 2011 alexingcool. All Rights Reserved. */ #include <iostream>#include <iterator>#include <algorithm>using namespace std;struct Node { Node(int i = 0, Node *l = NULL, Node *r = NULL) : item(i), left(l), right(r) {}  int item; Node *left; Node *right;};Node *Construct(){ Node *node6 = new Node(11); Node *node5 = new Node(9); Node *node4 = new Node(7); Node *node3 = new Node(5); Node *node2 = new Node(10, node5, node6); Node *node1 = new Node(6, node3, node4); Node *root = new Node(8, node1, node2); return root;}void Convert(Node *root){ if(root == NULL) return; Convert(root->left); //在這里試試swap(root->left, root->right)， //看輸出結果，有利于理解二叉樹遞歸 Convert(root->right); swap(root->left, root->right); }void InOrder(Node *root){ if(root) { InOrder(root->left); cout << root->item << " "; InOrder(root->right); }}void main(){ Node *root = Construct(); InOrder(root); cout << endl; Convert(root); InOrder(root);}