LeetCode:Invert Binary Tree
Posted walker lee
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了LeetCode:Invert Binary Tree相关的知识,希望对你有一定的参考价值。
Invert Binary Tree
Total Accepted: 92036 Total
Submissions: 200903 Difficulty: Easy
Invert a binary tree.
4 / 2 7 / \ / 1 3 6 9to
4 / 7 2 / \ / 9 6 3 1Trivia:
This problem was inspired by this original tweet by Max Howell:
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.
Subscribe to see which companies asked this question
c++ code:
/** * 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(NULL == root) return NULL; root->left = invertTree(root->left); root->right = invertTree(root->right); TreeNode *t = root->left; root->left = root->right; root->right = t; return root; } };
以上是关于LeetCode:Invert Binary Tree的主要内容,如果未能解决你的问题,请参考以下文章
binary-tree-zigzag-level-order-traversal——二叉树分层输出
Leetcode 103. Binary Tree Zigzag Level Order Traversal
#Leetcode# 103. Binary Tree Zigzag Level Order Traversal