To the Top
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 | 416 Views, 24911 Search Bots | 111 Words

Subscribe to Feed Burner | Browse | Archive
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:


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
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Cateogry: Computing | 416 Views, 24911 Search Bots | 111 Words Subscribe to Feed Burner

Related Articles

  1. Two Tricks of Delphi
  2. Generate All IP Addresses
  3. Fibonacci coding
  4. Consecutive Ones
  5. Plus One
  6. Spreadsheet Column Title
  7. Daily Interview Problem: Find the k-th Largest Element in a List
  8. Algorithm Interview Question: Nth Fibonacci Number
  9. Compare Version Numbers
  10. Daily Interview Problem: Circle of Chained Words

Comments (0)

    Be the first one to comment this page !


Page Edited: May 11 2024 14:36:49 | RSS Subscription
How to Cook a Perfect Steak? | <meta name="robots" content="index, follow">