Tag archives for tree traversal

  1. LeetCode in Swift: Binary Tree Level Order Traversal II

    Problem Statement Given a binary tree, return the bottom-up level order traversal of its nodes’ values. (ie, from left to right, level by level from leaf to root). For example: Given binary tree {3,9,20,#,#,15,7},

    return its bottom-up level order traversal as:

    Original LeetCode problem page My Solution in Swift Continue reading...

  2. LeetCode in Swift: Binary Tree Level Order Traversal

    Problem Statement Given a binary tree, return the level order traversal of its nodes’ values. (ie, from left to right, level by level). For example: Given binary tree {3,9,20,#,#,15,7},

    return its level order traversal as:

    Original LeetCode problem page My Solution in Swift Continue reading...