Leetcode - Insert into a Binary Search Tree (Python)

preview_player
Показать описание
October 2020 Leetcode Challenge
Leetcode - Insert into a Binary Search Tree #701
  1. Timothy H Chang
Рекомендации по теме
Insert into a 0:09:48

Insert into a Binary Search Tree - Leetcode 701 - Python

Leetcode - Insert 0:05:14

Leetcode - Insert into a Binary Search Tree (Python)

LeetCode 701. Insert 0:10:05

LeetCode 701. Insert into a Binary Search Tree (Algorithm Explained)

Search Insert Position 0:13:42

Search Insert Position - Binary Search - Leetcode 35 - Python

Insert into a 0:07:44

Insert into a Binary Search Tree | LeetCode 701 | C++

LEETCODE 701 (JAVASCRIPT) 0:07:44

LEETCODE 701 (JAVASCRIPT) | INSERT INTO A BINARY SEARCH TREE

Insert into a 0:05:44

Insert into a Binary Search Tree | Leetcode 701 | Recursive Iterative | Google Amazon | BST

Insert into a 0:10:56

Insert into a Binary Search Tree Leetcode | Leetcode 701 | Leetcode october challenge

Que12 Insert Delete 0:14:03

Que12 Insert Delete Get Random O(1) | LeetCode Solution | Top 150 interview Question

INSERT INTO CIRCULAR 0:15:25

INSERT INTO CIRCULAR LINKED LIST | LEETCODE # 708 | PYTHON SOLUTION

Insert into a 0:05:57

Insert into a Binary Search Tree | LeetCode 701 | Coding Interview Question

Insert into a 0:08:06

Insert into a Binary Search Tree | Leet code 701 | Theory explained + Python code

Leetcode Solution - 0:05:54

Leetcode Solution - 701 Insert into a Binary Search Tree

Insert into a 0:13:35

Insert into a Binary Search Tree🔥| Leetcode 701 | BST

LeetCode 701. [Medium] 0:04:21

LeetCode 701. [Medium] Insert into a Binary Search Tree

701. Insert into 0:05:30

701. Insert into a Binary Search Tree - Day 6/31 Leetcode October Challenge

Insert into a 0:03:33

Insert into a Binary Search Tree - LeetCode Problem - 6th October LeetCoding Challenge

LeetCode 708. Insert 0:09:49

LeetCode 708. Insert into a Cyclic Sorted List - Python

LeetCode 35 - 0:13:19

LeetCode 35 - Search Insert Position - Java Solution and Explanation

LeetCode 701. Insert 0:10:36

LeetCode 701. Insert into a Binary Search Tree Solution Explained - Java

Insert into a 0:07:24

Insert into a Binary Search Tree | LeetCode 701 | October LeetCode Challenge | Day 6

701. Insert into 0:03:26

701. Insert into a Binary Search Tree ( Leetcode Problem)

LeetCode in C# 0:03:18

LeetCode in C# | 35. Search Insert Position

701. Insert into 0:08:41

701. Insert into a Binary Search Tree - Day 12/31 Leetcode January Challenge

Комментарии
Автор

This problem scared me too for a bit until I noticed you could return 'any' valid BST. Thanks Tim!

janmichaelaustria
Автор

Thanks! What is the time complexity of the insertion operation?

d
Автор

Why can we not put the `if not root: return TreeNode(val)` within the `insert` function? I tried it and it fails on the null cases.

JL
Автор

is the insert() helper function necessary? how about using that same logic but within the parent function and replace those insert() calls with self.insertIntoBST()? you could save 4 lines :^)

for example:

def insertIntoBST(self, root: TreeNode, val: int) -> TreeNode:
if not root: return TreeNode(val)

if val < root.val:
if not root.left:
root.left = TreeNode(val)
else: self.insertIntoBST(root.left, val)
else:
if not root.right:
root.right = TreeNode(val)
else: self.insertIntoBST(root.right, val)

return root

xvzf