文件: root - text - article - 2020 - 02 - print-a-tree-level-by-level,-with-line-breaks.txt
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 596 次阅读, 27014 次搜索 | 111 个单词
| 浏览 | 博客存档
![定阅此目录的博客 定阅此目录的博客](/images/form/rss.gif)
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 596 次阅读, 27014 次搜索 | 111 个单词
![定阅此目录的博客 定阅此目录的博客](/images/form/rss.gif)
Hi, here's your problem today. This problem was recently asked by Apple:
You are given a tree, and your job is to print it level-by-level with linebreaks.
a
/ \
b c
/ \ / \
d e f g
The output should be
a
bc
defg
Here's a starting point:
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 596 次阅读, 27014 次搜索 | 111 个单词 You are given a tree, and your job is to print it level-by-level with linebreaks.
a
/ \
b c
/ \ / \
d e f g
The output should be
a
bc
defg
Here's a starting point:
from collections import deque
class Node(object):
def __init__(self, val):
self.val = val
self.left = None
self.right = None
def __str__(self):
# Fill this in.
tree = Node('a')
tree.left = Node('b')
tree.right = Node('c')
tree.left.left = Node('d')
tree.left.right = Node('e')
tree.right.left = Node('f')
tree.right.right = Node('g')
print tree
# a
# bc
# defg
![定阅此目录的博客 定阅此目录的博客](/images/form/rss.gif)
猜您喜欢...
- Maximum In A Stack
- Daily Interview Problem: Buddy Strings
- Staying on a Chess Board
- Daily Interview Problem: Circle of Chained Words
- Patterns for breaking down questions you haven
- Algorithm Interview: No Adjacent Repeating Characters
- Daily Interview Problem: Find the Number of Islands
- Daily Interview Problem: Reverse Integer
- Daily Interview Question: Word Search
- Reverse a Linked List
©2006~2024 牛排过熟 - 0.00728 秒 - 7957.837 KB/s - 856 在线
内存: 523.76 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="不索引, 跟踪" />
![](/images/top.jpg)
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - 服务器 PHP 版本号: 7.4.33
读写完全 - 一般 - 最小 - 表格 - 所有评论 - 统计
当前页暂时没有评论。