| 3 | TreeNode* second=NULL; |
| 4 | |
| 5 | void inorder(TreeNode* root) |
| 6 | { |
| 7 | if(root==NULL) |
| 8 | return; |
| 9 | inorder(root->left); |
| 10 | |
| 11 | if(prev!=NULL && root->val<prev->val) |
| 12 | { |
| 13 | if(first==NULL) |
| 14 | first=prev; |
| 15 | second=root; |
| 16 | } |
| 17 | prev=root; |
| 18 | inorder(root->right); |
| 19 | |
| 20 | } |
| 21 | void recoverTree(TreeNode* root) |
| 22 | { |
| 23 | inorder(root); |