leetcode-653-two-sum-iv-input-is-a-bst.swift

/**

Copyright (c) 2020 David Seek, LLC

Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:

The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.

THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR
OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE
OR OTHER DEALINGS IN THE SOFTWARE.





https://leetcode.com/problems/two-sum-iv-input-is-a-bst/


Given a Binary Search Tree and a target number, return true if there exist two elements in the BST such that their sum is equal to the given target.

Example 1:

Input: 
    5
   / \
  3   6
 / \   \
2   4   7

Target = 9

Output: True
 

Example 2:

Input: 
    5
   / \
  3   6
 / \   \
2   4   7

Target = 28

Output: False

*/

/**
Big O Annotation
Time complexity O(n) where n is the amount of elements in nums.
Space complexity O(n) where n is the amount of elements in nums.
*/
func findTarget(_ root: TreeNode?, _ k: Int) -> Bool {
        
    /**
    Create a map of values.
    Key and Value will be the val of a node.
    */  
    var hash: [Int: Int] = [:]

    // Traverse the tree
    root?.traverse { hash[$0, default: 0] = $0 }
    
    // Check for each element
    for (key, _) in hash {   

        // If we can find an element that sums up to k         
        if let mapped = hash[k - key], key != mapped {
            return true
        }
    }
    
    // If not, return false
    return false 
}

// Simple Pre order traversal
fileprivate extension TreeNode {
    func traverse(_ visit: (Int) -> Void) {

        visit(val)
        left?.traverse(visit)
        right?.traverse(visit)
    }
}