226.InvertABinaryTree
来源:互联网 发布:如何在淘宝上买东西 编辑:程序博客网 时间:2024/06/10 22:18
226. Invert Binary Tree
Invert a binary tree.
4 / \ 2 7 / \ / \1 3 6 9to 4 / \ 7 2 / \ / \9 6 3 1
/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */class Solution {public: TreeNode* invertTree(TreeNode* root) { if(root== nullptr) return root; swap(root->right,root->left); invertTree(root->right); invertTree(root->left); return root; }};
阅读全文
0 0
- 226.InvertABinaryTree
- 226.Invert Binary Tree
- 226. Invert Binary Tree
- 226. Invert Binary Tree
- 226. Invert Binary Tree
- 226. Invert Binary Tree
- 226. Invert Binary Tree
- 226. Invert Binary Tree
- 226. Invert Binary Tree
- 226. Invert Binary Tree
- 226. Invert Binary Tree
- 226. Invert Binary Tree
- 226. Invert Binary Tree
- 226. Invert Binary Tree
- 226. Invert Binary Tree
- 226. Invert Binary Tree
- 226. Invert Binary Tree
- 226. Invert Binary Tree
- Javascript模块化编程(一):模块的写法
- Android 玩机
- JSON的使用及与java对象之间的转换介绍
- Java 反射教程
- Web安全测试之跨站请求伪造(CSRF)
- 226.InvertABinaryTree
- 文章标题
- Java中<? extends T>和<? super T>的理解,泛型的使用规则
- 题目:生日蜡烛
- 线程与进程的区别
- redis启动报错
- 网线连接共享网络
- 搭建sonar+Jenkins+Maven+SVN完成持续集成代码分析管理
- Docker CentOS服务器搭建本地私有仓库