leetcode Revert Binary Tree
homebrew的作者面试google,面试官要求他手写一个反转一个二叉树的功能。最后却没写出来,于是有了下面的新闻:
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.
Invert a binary tree.
4/ \2 7/ \ / \ 1 3 6 9
to
4/ \7 2/ \ / \ 9 6 3 1
这个题我在书上看到过,我认为上面的图解比较清楚,就放了上来。
大体思路:一层一层反转左右节点,直到下到叶子
/*** Definition for a binary tree node.* struct TreeNode {* int val;* struct TreeNode *left;* struct TreeNode *right;* };*/
struct TreeNode* invertTree(struct TreeNode* root) {if(root == NULL)return ;if(root->left == NULL && root->right == NULL)return root;struct TreeNode* temp;temp=root->left;root->left = root->right;root->right = temp;if(root->left)invertTree(root->left);if(root->right)invertTree(root->right);return root;}
leetcode Revert Binary Tree相关推荐
- LeetCode: 107. Binary Tree Level Order Traversal II
题目 Given a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from l ...
- LeetCode: 103. Binary Tree Zigzag Level Order Traversal
题目 Given a binary tree, return the zigzag level order traversal of its nodes' values. (ie, from left ...
- LeetCode: Flatten Binary Tree to Linked List
LeetCode: Flatten Binary Tree to Linked List LeetCode: Flatten Binary Tree to Linked List Given a bi ...
- 【重点】LeetCode 124. Binary Tree Maximum Path Sum
LeetCode 124. Binary Tree Maximum Path Sum 参考链接:http://zxi.mytechroad.com/blog/tree/leetcode-124-bin ...
- LeetCode 103. Binary Tree Zigzag Level Order Traversal
LeetCode 103. Binary Tree Zigzag Level Order Traversal Solution1:基于层次遍历的微改 /*** Definition for a bin ...
- LeetCode 107. Binary Tree Level Order Traversal II
LeetCode 107. Binary Tree Level Order Traversal II Solution1:我的答案 比102那道题多了一行代码... /*** Definition f ...
- 【二叉树的迭代版后序遍历】LeetCode 145. Binary Tree Postorder Traversal
LeetCode 145. Binary Tree Postorder Traversal Solution1:递归版答案 二叉树的后序遍历递归版是很简单的,关键是迭代版的代码既难理解又难写!但听了花 ...
- 【二叉树迭代版中序遍历】LeetCode 94. Binary Tree Inorder Traversal
LeetCode 94. Binary Tree Inorder Traversal Solution1:递归版 二叉树的中序遍历递归版是很简单的,中序遍历的迭代版需要特殊记一下! 迭代版链接:htt ...
- 【二叉树迭代版前序遍历】LeetCode 144. Binary Tree Preorder Traversal
LeetCode 144. Binary Tree Preorder Traversal Solution1:递归版 二叉树的前序遍历递归版是很简单的,前序遍历的迭代版相对是最容易理解的. 迭代版链接 ...
最新文章
- android技术内幕心得
- asp.net 包含动态创建控件的容器如果要切换显示/隐藏不要用 Visible 属性
- MySQL获取数据库每个表的行数
- [转载红鱼儿]delphi 实现微信开发(2)接入微信公众号平台
- @using (Html.BeginForm())参数示例
- Oracle 函数进阶、分组排序、列转行、cast 类型转换、dbms_random 生成随机数、sys_guid
- 同一家公司不同CPU的LINUX,还是有所差异
- HDFS副本存放机制
- 离散分布——泊松分布、指数分布
- 如何使用计算机网络打印机,电脑怎么连接网络打印机 网络打印机连接方法
- 如何阅读《如何阅读一本书》?
- hadoop-HFDS
- 多精度里FNT和SSA的点滴
- Fama-French三因子模型
- 大数据开发教程——构建Hadoop开发环境
- 如何借用淘宝巧获海量精准流量?
- mysql create database xx-xxx异常You have an error in your SQL syntax
- 各大互联网公司都有哪些部门?核心部门又是什么?一文全知道!
- 先下手为强 Google桌面搜索出炉
- LVM的常用操作【创建lvm】