LeetCode.226. Invert Binary Tree
這道題很簡單了,只需要遞迴的交換左右子樹就好了
class Solution {
public TreeNode invertTree(TreeNode root) {
helper(root);
return root;
}
public void helper(TreeNode root) {
if (root == null) {
return;
}
TreeNode temp = root.left;
root. left = root.right;
root.right = temp;
helper(root.left);
helper(root.right);
}
}
相關推薦
LeetCode 226 Invert Binary Tree(轉換二叉樹)
public pretty mar containe ret clas move 出錯 uil 翻譯 將下圖中上面的二叉樹轉換為以下的形式。詳細為每一個左孩子節點和右孩子節點互換位置。 原文 如上圖 分析 每次關於樹的題目出
leetcode 226 Invert Binary Tree 翻轉二叉樹
war lee line stat push white push_back use strong 大牛沒有能做出來的題,我們要好好做一做 Invert a binary tree. 4 / 2 7 / \ /
Leetcode 226. Invert Binary Tree(easy)
war ini off origin lock efi software eas com Invert a binary tree. 4 / 2 7 / \ / 1 3 6 9 to 4 / 7
leetcode 226. Invert Binary Tree
bin spa clas node == span rtt binary solution class Solution { public: TreeNode* invertTree(TreeNode* root) { if(root == N
#Leetcode# 226. Invert Binary Tree
https://leetcode.com/problems/invert-binary-tree/ Invert a binary tree. Example: Input: 4 / \ 2 7 / \ / \ 1 3 6 9 Outpu
[LeetCode] 226. Invert Binary Tree
#題目 Invert a binary tree. Example: Input: 4 / 2 7 / \ / 1 3 6 9 Output: 4 / 7 2 / \ / 9 6 3 1 Triv
LeetCode.226. Invert Binary Tree
這道題很簡單了,只需要遞迴的交換左右子樹就好了 class Solution { public TreeNode invertTree(TreeNode root) { helper(root); return root
JavaScript刷LeetCode -- 226. Invert Binary Tree
一、題目 Invert a binary tree.   Example:   Input: 4 / \ 2 7 / \ / \ 1 3 6 9 &emsp
LeetCode-226.Invert Binary Tree
class != NPU rtt output input ava inpu pty Invert a binary tree. Example: Input: 4 / 2 7 / \ / 1 3 6 9 Outpu
leetcode 226 Invert Binary Tree 翻轉二叉樹
pub null bsp bin nod nbsp alt init pty C++代碼,方法層序+互換左右孩子 1 /** 2 * Definition for a binary tree node. 3 * struct TreeNode
[LeetCode&Python] Problem 226. Invert Binary Tree
Invert a binary tree. Example: Input: 4 / \ 2 7 / \ / \ 1 3 6 9 Output: 4 / \ 7 2 / \ / \ 9
226. Invert Binary Tree
def war rec highlight via val block boa stat Invert a binary tree. 4 / 2 7 / \ / 1 3 6 9 to 4 / 7
LC.226.Invert Binary Tree
problems ack size nbsp space == OS body sta https://leetcode.com/problems/invert-binary-tree/description/Invert a binary tree. 4 /
226. Invert Binary Tree(Tree)
https://leetcode.com/problems/invert-binary-tree/description/ 題目:將二叉樹進行翻轉 思路:使用BFS進行遍歷,然後交換每個結點的左右子節點。 class Solution { public: TreeNo
LeetCode(47) Invert Binary Tree
題目描述 Invert a binary tree. => 題目要求將二叉樹的左右子樹進行逆轉。 解題思路 根據題目的要求可以進行一層一層的逆轉,也就是交換結點的左右子樹。將未處理的元素放入棧中,本題的關鍵在於對於元素的入棧順序進行控制。 /** * D
226. Invert Binary Tree(翻轉樹)
war alt boa origin original sta rsquo png oar Invert a binary tree. Example: Input: 4 / 2 7 / \ / 1 3 6 9 Ou
226. 翻轉二叉樹 | Invert Binary Tree
ble use homebrew spi brew home .com wro emp Invert a binary tree. Example: Input: 4 / 2 7 / \ / 1 3 6 9 O
[LeetCode] Invert Binary Tree 翻轉二叉樹
Invert a binary tree. // Recursion class Solution { public: TreeNode* invertTree(TreeNode* root) { if (!root) return NULL;
leetcode Invert Binary Tree
Invert Binary Tree 題目:https://leetcode.com/problems/invert-binary-tree/ Invert Binary Tree 交換二叉樹 public static void main(String[] args
LeetCode刷題EASY篇Invert Binary Tree
題目 Invert a binary tree. Example: Input: 4 / \ 2 7 / \ / \ 1 3 6 9 Output: 4 / \ 7 2 / \ / \ 9