Merge Two Binary Trees - Swift Solution @ LeetCode

Merge Two Binary Trees, is a LeetCode problem from Tree subdomain. In this post we will see how we can solve this challenge in Swift

Problem Description

You can find the full details of the problem Merge Two Binary Trees at LeetCode

Solution

public var val: Int

public var left: TreeNode?

public var right: TreeNode?

public init(_ val: Int) {

    self.val = val

    self.left = nil

    self.right = nil

}

}

Please check the main.swift snippet for the solution.

This solution originally posted at: Github by @soapyigu