File: root - text - article - 2019 - 11 - create-a-balanced-binary-search-tree.txt
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 386 Views, 20939 Search Bots | 111 Words
| Browse | Archive
![Subscribe to Feed Burner Subscribe to Feed Burner](/images/form/rss.gif)
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 386 Views, 20939 Search Bots | 111 Words
![Subscribe to Feed Burner Subscribe to Feed Burner](/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:
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Cateogry: Computing | 386 Views, 20939 Search Bots | 111 Words 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
![Subscribe to Feed Burner Subscribe to Feed Burner](/images/form/rss.gif)
Related Articles
- Delphi Dynamic Array
- Daily Interview Problem: Find the Number of Islands
- Top K Frequent words
- Daily Interview Puzzle: Ways to Traverse a Grid
- Daily Interview Problem: Tree Serialization
- Daily Interview Problem: Merge Overlapping Intervals
- Multitasking
- [Daily Problem] Longest Increasing Subsequence
- Daily Interview Problem: 3 Sum
- Daily Interview Question: Edit Distance
©2006~2024 SteakOverCooked - 0.00834 Seconds(s) - 2490.978 KB/s - 20 Online
Memory: 492.98 KB
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - Server PHP Version: 7.4.33
How to Cook a Perfect Steak? | <meta name="robots" content="noindex, follow" />
![](/images/top.jpg)
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - Server PHP Version: 7.4.33
Read & Write - Normal - Mini - Post - All Comments - Statistics
Be the first one to comment this page !