1
0
Fork 0
mirror of https://gitlab.com/mfocko/LeetCode.git synced 2024-11-10 00:09:06 +01:00

problems(swift): add “606. Construct String from Binary Tree”

Signed-off-by: Matej Focko <mfocko@redhat.com>
This commit is contained in:
Matej Focko 2023-12-08 22:19:37 +01:00
parent ffa227587e
commit 11187c2700
Signed by: mfocko
GPG key ID: 7C47D46246790496

View file

@ -0,0 +1,37 @@
/**
* Definition for a binary tree node.
* public class TreeNode {
* public var val: Int
* public var left: TreeNode?
* public var right: TreeNode?
* public init() { self.val = 0; self.left = nil; self.right = nil; }
* public init(_ val: Int) { self.val = val; self.left = nil; self.right = nil; }
* public init(_ val: Int, _ left: TreeNode?, _ right: TreeNode?) {
* self.val = val
* self.left = left
* self.right = right
* }
* }
*/
class Solution {
func tree2str(_ root: TreeNode?) -> String {
if let root = root {
let left = tree2str(root.left)
let right = tree2str(root.right)
var l = ""
if left != "" || right != "" {
l = "(\(left))"
}
var r = ""
if right != "" {
r = "(\(right))"
}
return "\(root.val)\(l)\(r)"
}
return ""
}
}