页面顶部 Top
文件:  root - text - article - 2020 - 02 - making-a-height-balanced-binary-search-tree.txt.txt
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 385 次阅读, 23155 次搜索 | 104 个单词

定阅此目录的博客 | 浏览 | 博客存档
Hi, here's your problem today. This problem was recently asked by Google:

Given a sorted list, create a height balanced binary search tree, meaning the height differences of each node can only differ by at most 1.

Here's some code to start with:


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

def __str__(self):
answer = str(self.value)
if self.left:
answer += str(self.left)
if self.right:
answer += str(self.right)
return answer

def create_height_balanced_bst(nums):
# Fill this in.

tree = create_height_balanced_bst([1, 2, 3, 4, 5, 6, 7, 8])
# 53214768
# (pre-order traversal)
# 5
# / \
# 3 7
# / \ / \
# 2 4 6 8
# /
# 1
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 385 次阅读, 23155 次搜索 | 104 个单词 定阅此目录的博客

猜您喜欢...

  1. How to Play WAV music under DOS?
  2. Staying on a Chess Board
  3. [Daily Problem] Witness of The Tall People
  4. Number of Ways to Climb Stairs
  5. Patterns for breaking down questions you haven
  6. Algorithm Interview: String Compression
  7. Windows Scripting
  8. CPU Utilization
  9. Algorithm Interview: Subarray With Target Sum
  10. Most Frequent Subtree Sum

评论 (0)

    当前页暂时没有评论。


最后更新: October 30 2020 14:21:12 | RSS Subscription
牛排怎么做才好吃? | <meta name="机器人" content="不索引, 跟踪" />