题目地址: [翻转二叉树](https://leetcode.cn/problems/invert-binary-tree/) #### 代码 ``` var invertTree = function(root) { if(!root) { return null } return { val: root.val, left: invertTree(root.right), right: invertTree(root.left), } }; ```
题目地址: 翻转二叉树
代码