题解 | #翻转牛群结构#
翻转牛群结构
https://www.nowcoder.com/practice/f17e1aa5329f492f9107cbe303222ad6
import java.util.*; /* * public class TreeNode { * int val = 0; * TreeNode left = null; * TreeNode right = null; * public TreeNode(int val) { * this.val = val; * } * } */ public class Solution { /** * 代码中的类名、方法名、参数名已经指定,请勿修改,直接返回方法规定的值即可 * * * @param root TreeNode类 * @return TreeNode类 */ public TreeNode invertTree (TreeNode root) { // write code here if (root == null) return root; TreeNode left = root.left; TreeNode right = root.right; root.left = invertTree(right); root.right = invertTree(left); return root; } }
- 边界值:root等于null,直接返回
- 分别递归左右子树进行翻转
线性表基础 文章被收录于专栏
链表、递归、栈