To the Top
File:  root - text - article - 2020 - 01 - level-order-traversal-of-binary-tree.txt
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 245 Views, 22904 Search Bots | 73 Words

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


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

Related Articles

  1. Making a Height Balanced Binary Search Tree
  2. Daily Interview Problem: Sort Colors
  3. Algorithm Interview: Longest Consecutive Sequence
  4. Spectrum Master
  5. CVE-2015-8874 - cPanel EasyApache Vulnerabilities
  6. Daily Interview Problem: Group Words that are Anagrams
  7. Spreadsheet Column Title
  8. Daily Interview Problem: Room scheduling
  9. Sorting a list with 3 unique numbers
  10. Number of Ways to Climb Stairs

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="noindex, follow" />