常量空间遍历二叉树 (二)

2014-11-24 02:24:18 · 作者: · 浏览: 3
int)previous->left | 0x01);
next = (TreeNode*)((int)previous->left & 0xfffffffe);
previous->left = (TreeNode*)(((int)previous->left & 0x01) | (int)current);
current = previous->right;
previous->right = next;
}
}
}