2014-09-03 Problem of the Day solution in Swift

2014-09-03-potd-swift

// http://www.problemotd.com/problem/level-order-traversal/

class BinaryTree<T> {
    init(value: T) {
        self.value = value
    }
    
    var value: T
    var left: BinaryTree<T>?
    var right: BinaryTree<T>?
}

let fTree = BinaryTree<String>(value:"F")
let bTree = BinaryTree<String>(value: "B")
let gTree = BinaryTree<String>(value: "G")
let aTree = BinaryTree<String>(value: "A")
let dTree = BinaryTree<String>(value: "D")
let iTree = BinaryTree<String>(value: "I")
let cTree = BinaryTree<String>(value: "C")
let eTree = BinaryTree<String>(value: "E")
let hTree = BinaryTree<String>(value: "H")

fTree.left = bTree
fTree.right = gTree
bTree.left = aTree
bTree.right = dTree
gTree.right = iTree
dTree.left = cTree
dTree.right = eTree
iTree.left = hTree

var nodesVisited: [BinaryTree<String>] = []
var index = 0

nodesVisited.append(fTree)

while index < nodesVisited.count {
    let currentNode = nodesVisited[index]
    println(currentNode.value)

    if let left = currentNode.left {
        nodesVisited.append(left)
    }
    
    if let right = currentNode.right {
        nodesVisited.append(right)
    }
    
    index++
}