[swift] LeetCode 94. Binary Tree Inorder Traversal

Given a binary tree, return the inorder traversal of its nodes’ values.

For example:
Given binary tree [1,null,2,3],
1
\
2
/
3
return [1,3,2].

func inorderTraversal(_ root: TreeNode?) -> [Int] {
    var list = [Int](), stack = [TreeNode](), p = root

    while p != nil || !stack.isEmpty {
        if let t = p {
            stack.append(t)
            p = t.left
        } else {
            let t = stack.popLast()!
            list.append(t.val)
            p = t.right
        }
    }

    return list
}

func inorderTraversal(_ root: TreeNode?) -> [Int] {

var list = [Int](), stack = [TreeNode](), p = root

while p != nil || !stack.isEmpty {

if let t = p {

stack.append(t)

p = t.left

} else {

let t = stack.popLast()!

list.append(t.val)

p = t.right

}

return list

}

❤ 点击这里 -> 订阅《PAT | 蓝桥 | LeetCode学习路径 & 刷题经验》by 柳婼

❤ 点击这里 -> 订阅《从放弃C语言到使用C++刷算法的简明教程》by 柳婼

❤ 点击这里 -> 订阅PAT甲级乙级、蓝桥杯、GPLT天梯赛、LeetCode题解离线版