File: root - text - article - 2020 - 02 - making-a-height-balanced-binary-search-tree.txt.txt
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 652 Views, 28665 Search Bots | 104 Words
| Browse | Archive
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 652 Views, 28665 Search Bots | 104 Words
| Browse | Archive
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:
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Cateogry: Computing | 652 Views, 28665 Search Bots | 104 Words 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
Related Articles
- Algorithm Interview: Make the Largest Number
- Daily Interview Problem: First Missing Positive Integer
- Maximum In A Stack
- Fix Brackets
- Daily Interview Problem: Largest Product of 3 Elements I
- Algorithm Interview: Subarray With Target Sum
- Fibonacci coding
- Daily Interview Problem: Word Ordering in a Different Alphabetical Order
- Algorithm Interview: Smallest Number that is not a Sum of a Subset of List
- Patterns for breaking down questions you haven
©2006~2024 SteakOverCooked - 0.00793 Seconds(s) - 2569.622 KB/s - 25 Online Memory: 496.09 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="index, follow">
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - Server PHP Version: 7.4.33
Comments (0)
Read & Write - Normal - Mini - Post - All Comments - Statistics
Be the first one to comment this page !