File: root - text - article - 2020 - 02 - print-a-tree-level-by-level,-with-line-breaks.txt
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 565 Views, 26377 Search Bots | 111 Words
| Browse | Archive
![Subscribe to Feed Burner Subscribe to Feed Burner](/images/form/rss.gif)
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 565 Views, 26377 Search Bots | 111 Words
![Subscribe to Feed Burner Subscribe to Feed Burner](/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:
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Cateogry: Computing | 565 Views, 26377 Search Bots | 111 Words 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
![Subscribe to Feed Burner Subscribe to Feed Burner](/images/form/rss.gif)
Related Articles
- New Vulnerabilities (CVE-2016-4581) have been detected in CentOS/RHEL/CloudLinux 7
- Algorithm Interview: Smallest Number that is not a Sum of a Subset of List
- Non-decreasing Array with Single Modification
- Daily Interview Question: Longest Sequence with Two Unique Numbers
- Daily Interview Problem: Reverse Integer
- CPU Utilization
- Algorithm Interview: Convert Roman Numerals to Decimal
- Daily Interview Puzzle: Falling Dominoes
- Daily Interview Problem: Reconstrunct Binary Tree from Preorder and Inorder Traversals
- Detect Linked List Cycle
©2006~2024 SteakOverCooked - 0.00851 Seconds(s) - 2372.815 KB/s - 125 Online
Memory: 493.28 KB
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - Server PHP Version: 7.4.33
How to Cook a Perfect Steak? | <meta name="robots" content="noindex, follow" />
![](/images/top.jpg)
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - Server PHP Version: 7.4.33
Read & Write - Normal - Mini - Post - All Comments - Statistics
Be the first one to comment this page !