文件: root - text - article - 2020 - 01 - level-order-traversal-of-binary-tree.txt
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 501 次阅读, 27727 次搜索 | 73 个单词
| 浏览 | 博客存档
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 501 次阅读, 27727 次搜索 | 73 个单词
| 浏览 | 博客存档
Hi, here's your problem today. This problem was recently asked by Microsoft:
Given the root of a binary tree, print its level-order traversal. For example:
The following tree should output 1, 2, 3, 4, 5.
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 501 次阅读, 27727 次搜索 | 73 个单词 Given the root of a binary tree, print its level-order traversal. For example:
1
/ \
2 3
/ \
4 5
The following tree should output 1, 2, 3, 4, 5.
class Node:
def __init__(self, val, left=None, right=None):
self.val = val
self.left = left
self.right = right
def print_level_order(root):
# Fill this in.
root = Node(1, Node(2), Node(3, Node(4), Node(5)))
print_level_order(root)
# 1 2 3 4 5
猜您喜欢...
- Sorting a list with 3 unique numbers
- Two-Sum
- Daily Interview Problem: Room scheduling
- Daily Interview Problem: Look and Say Sequence
- Kaprekar
- Find the non-duplicate number
- [Daily Problem] Remove Consecutive Nodes that Sum to 0
- Daily Interview Problem: Longest Substring With K Distinct Characters
- Palindrome Integers
- Algorithm Interview Question: Symmetric k-ary Tree
©2006~2024 牛排过熟 - 0.01953 秒 - 1046.085 KB/s - 25 在线 内存: 493.78 KB
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - 服务器 PHP 版本号: 7.4.33
牛排怎么做才好吃? | <meta name="机器人" content="索引, 跟踪">
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - 服务器 PHP 版本号: 7.4.33
评论 (0)
读写完全 - 一般 - 最小 - 表格 - 所有评论 - 统计
当前页暂时没有评论。