|
| 1 | +/** |
| 2 | + * Example: |
| 3 | + * var ti = TreeNode(5) |
| 4 | + * var v = ti.`val` |
| 5 | + * Definition for a binary tree node. |
| 6 | + * class TreeNode(var `val`: Int) { |
| 7 | + * var left: TreeNode? = null |
| 8 | + * var right: TreeNode? = null |
| 9 | + * } |
| 10 | + */ |
| 11 | +//https://leetcode.com/problems/symmetric-tree/description |
| 12 | +class Solution { |
| 13 | + fun isSymmetric(root: TreeNode?): Boolean { |
| 14 | + return isSymetric(root?.left, root?.right) |
| 15 | + } |
| 16 | + |
| 17 | + fun isSymetric(leftNode: TreeNode?, rightNode: TreeNode?): Boolean{ |
| 18 | + if(leftNode == null && rightNode == null) return true |
| 19 | + if(leftNode == null || rightNode == null) return false |
| 20 | + if(leftNode.`val` != rightNode.`val`) return false |
| 21 | + |
| 22 | + return isSymetric(leftNode.left, rightNode.right) && isSymetric(leftNode.right, rightNode.left) |
| 23 | + } |
| 24 | +} |
0 commit comments