To the Top
File:  root - text - article - 2019 - 11 - get-all-values-at-a-certain-height-in-a-binary-tree.txt.txt
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 501 Views, 29653 Search Bots | 81 Words

Subscribe to Feed Burner | Browse | Archive
Hi, here's your problem today. This problem was recently asked by Amazon:

Given a binary tree, return all values given a certain height h.

Here's a starting point:


class Node():
def __init__(self, value, left=None, right=None):
self.value = value
self.left = left
self.right = right

def valuesAtHeight(root, height):
# Fill this in.

# 1
# / \
# 2 3
# / \ \
# 4 5 7

a = Node(1)
a.left = Node(2)
a.right = Node(3)
a.left.left = Node(4)
a.left.right = Node(5)
a.right.right = Node(7)
print valuesAtHeight(a, 3)
# [4, 5, 7]
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Cateogry: Computing | 501 Views, 29653 Search Bots | 81 Words Subscribe to Feed Burner

Related Articles

  1. Daily Interview Puzzle: Falling Dominoes
  2. Daily Interview Problem: Running Median
  3. Daily Interview Problem: Count Number of Unival Subtrees
  4. Absolute Path
  5. Top K Frequent words
  6. Algorithm Interview Question: Find the Single Element in an Array of Duplicates
  7. Algorithm Interview: Level Order Traversal of Binary Tree
  8. Algorithm Interview: Permutations of numbers
  9. Floor and Ceiling of a Binary Search Tree
  10. Invert a Binary Tree

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" />