文件: root - text - article - 2019 - 11 - create-a-balanced-binary-search-tree.txt
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 382 次阅读, 20715 次搜索 | 111 个单词
| 浏览 | 博客存档
![定阅此目录的博客 定阅此目录的博客](/images/form/rss.gif)
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 382 次阅读, 20715 次搜索 | 111 个单词
![定阅此目录的博客 定阅此目录的博客](/images/form/rss.gif)
Hi, here's your problem today. This problem was recently asked by LinkedIn:
Given a sorted list of numbers, change it into a balanced binary search tree. You can assume there will be no duplicate numbers in the list.
Here's a starting point:
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 382 次阅读, 20715 次搜索 | 111 个单词 Given a sorted list of numbers, change it into a balanced binary search tree. You can assume there will be no duplicate numbers in the list.
Here's a starting point:
from collections import deque
class Node:
def __init__(self, value, left=None, right=None):
self.value = value
self.left = left
self.right = right
def __str__(self):
# level-by-level pretty-printer
nodes = deque([self])
answer = ''
while len(nodes):
node = nodes.popleft()
if not node:
continue
answer += str(node.value)
nodes.append(node.left)
nodes.append(node.right)
return answer
def createBalancedBST(nums):
# Fill this in.
print createBalancedBST([1, 2, 3, 4, 5, 6, 7])
# 4261357
# 4
# / \
# 2 6
#/ \ / \
#1 3 5 7
![定阅此目录的博客 定阅此目录的博客](/images/form/rss.gif)
猜您喜欢...
- [Daily Problem] Course Prerequisites
- Daily Interview Problem: Arithmetic Binary Tree
- Two-Sum
- Consecutive Ones
- Daily Interview Question: Edit Distance
- Reverse a Directed Graph
- [Daily Problem] Angles of a Clock
- Daily Interview Problem: Count Number of Unival Subtrees
- Daily Interview Question: Find Cycles in a Graph
- Algorithm Interview Question: Find the Single Element in an Array of Duplicates
©2006~2024 牛排过熟 - 0.00768 秒 - 2721.405 KB/s - 13 在线
内存: 493.02 KB
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - 服务器 PHP 版本号: 7.4.33
牛排怎么做才好吃? | <meta name="机器人" content="不索引, 跟踪" />
![](/images/top.jpg)
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - 服务器 PHP 版本号: 7.4.33
读写完全 - 一般 - 最小 - 表格 - 所有评论 - 统计
当前页暂时没有评论。