您的位置:首页 > 其它

[2016/11/17]翻转二叉树

2016-11-18 13:29 155 查看
Google: 90% of our engineers use the software you wrote (Homebrew), but you can’t invert a binary tree on a whiteboard so fuck off.


内心复杂地做完了这道带有传奇色彩的题。。

代码如下:

struct TreeNode* invertTree(struct TreeNode* root) {
struct TreeNode* p;
if(!root)
return NULL;
else{
p = root -> left;
root -> left = root -> right;
root -> right = p;
}
invertTree(root -> left);
invertTree(root -> right);
return root;
}
内容来自用户分享和网络整理,不保证内容的准确性,如有侵权内容,可联系管理员处理 点击这里给我发消息
标签: