1448-Count Good Nodes in Binary Tree -- SWIFT

[nprepaci]

• File(s) Modified: 1448-Count-Good-Nodes-In-Binary-Tree.swift
• Language(s) Used: Swift
• Submission URL: https://leetcode.com/submissions/detail/817258180/

[dissesmac]

You can make in this way

let i = root.val >= lastVal ? 1 : 0
let left = helper(root.left, max(lastVal, root.val))
let right = helper(root.right, max(lastVal, root.val))
return i + left + right

And using let more profitable for compiler

[nprepaci]

Great suggestion. Updated in most recent commit.