给你一棵二叉树的根节点root翻转这棵二叉树并返回其根节点。示例 1输入root [4,2,7,1,3,6,9]输出[4,7,2,9,6,3,1]示例 2输入root [2,1,3]输出[2,3,1]示例 3输入root []输出[]提示树中节点数目范围在[0, 100]内-100 Node.val 100/** * Definition for a binary tree node. * class TreeNode { * val: number * left: TreeNode | null * right: TreeNode | null * constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) { * this.val (valundefined ? 0 : val) * this.left (leftundefined ? null : left) * this.right (rightundefined ? null : right) * } * } */ function invertTree(root: TreeNode | null): TreeNode | null { if(!root) return null let temp root.left root.left root.right root.right temp invertTree(root.left) invertTree(root.right) return root };共勉
【每日一题】LeetCode 226. 翻转二叉树TypeScript
发布时间：2026/5/30 4:41:19
给你一棵二叉树的根节点root翻转这棵二叉树并返回其根节点。示例 1输入root [4,2,7,1,3,6,9]输出[4,7,2,9,6,3,1]示例 2输入root [2,1,3]输出[2,3,1]示例 3输入root []输出[]提示树中节点数目范围在[0, 100]内-100 Node.val 100/** * Definition for a binary tree node. * class TreeNode { * val: number * left: TreeNode | null * right: TreeNode | null * constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) { * this.val (valundefined ? 0 : val) * this.left (leftundefined ? null : left) * this.right (rightundefined ? null : right) * } * } */ function invertTree(root: TreeNode | null): TreeNode | null { if(!root) return null let temp root.left root.left root.right root.right temp invertTree(root.left) invertTree(root.right) return root };共勉
