Leetcode - Delete Node in a BST (Python)

Показать описание

August 2020 Leetcode Challenge
Leetcode - Delete Node in a BST

Last problem of month! Thanks for watching!!

Timothy H Chang

Рекомендации по теме

Комментарии

Thank you for this video! Conquered a lot of harder lc problems but this one never really “clicked” for me until I heard your explanation

Chewibub

bro gives a "i have no enemies" kinda vibe, chill af

AnuragNimonkar

Thank you for explaining all the questions in an easy-to-understand manner!

Sir, you always give very simple solution to complicated problems.. Thanks

sharifmansuri

thanks man, i searched this for more than 3 hrs

drakolubez

this solution is the clearest one I have found

Kyou-by

"Do not trust me, I know nothing". Man, I'm sure gonna miss that bro. Way to finish off the month strong. Tim, your videos have helped so much. I think on the really hard problems I'd look at some of the solutions on leetcode, but then after watching you videos, it all just clicks.

I hope you kill it over in SF! Hopefully our paths will cross some day.

janmichaelaustria

Thank you so much sir Im learning the simple way from your code

thejasveejaggi

if you say "do not trust me, I know nothing", what am I supposed to say??

m.y.m

That was such a great explanation, thanks a mill, Timothy! :)

mukhammadmuratov

Why do we set root.left = delete(root.left, key), Why are we setting this to equal to the return value? What's the purpose?

vaishaksid

Thank You for the explanation. It was pretty helpful !!

jayantdhingra

this solution is creepy. Much better than the leetcode official one

cyliu

Root.left= self.deleteNode(root.right, root.val)
And
If not root.right and root.left : root.left ..
In above lines is root.left is same

RBTIT

I cannot pass the test case with the original code. It works after I change this:

if not root.left and not root.left: return None
if not root.left and root.right: return root.right
if root.left and not root.right: return root.left

to this:

if not root.right: return root.left
if not root.left: return root.right

I don't know the reason tho...

cici-lxnp

I think if you replace lines 18-20 with the following lines the code is a little cleaner and easier to understand:

while ptr.left:
prev = ptr
ptr = ptr.left
node.val = ptr.val
prev.left = None

gicuab

Sir this code doesn't work on edge case like
100
/
70
\80
100 is root, 70 is it's left child and 80 is right child of 70. And if we try to delete 100. As it doesn't enters the recursion that is why happens.

sharifmansuri

Leetcode - Delete Node in a BST (Python)

Delete Node in a BST - Leetcode 450 - Python

Delete Node in a Linked List | Leetcode #237

LeetCode 237. Delete Node in a Linked List Solution Explained - Java

Leetcode - Delete Node in a Linked List (Python)

Leetcode - Delete Node in a BST (Python)

Delete Node in a BST - LeetCode 450 - Python #leetcode #leetcode75

Delete Node in a Linked List | LeetCode 237 | Java

LeetCode 237: Delete Node in a Linked List - Interview Prep Ep 57

Delete Node in a Linked List | Leetcode 237

Delete Node in a Linked List | Can you solve it ?

Leetcode 237. Delete Node in a Linked List Python

Delete Node in a Linked List - LeetCode 237 - Python #leetcode #linkedlist

4 Leetcode Mistakes

Delete Node in a Linked List Leetcode | Leetcode 237 | O(1) Solution

237. Delete Node in a Linked List - Day 13/31 Leetcode October Challenge

LEETCODE 237 (JAVASCRIPT) | DELETE A NODE IN A LINKED LIST

Leetcode Interviews

LeetCode 237 - Delete Node in a Linked List - Java

LeetCode#237 Delete Node in a Linked List - Python

Delete Node in a Linked List without head node| Java| Leetcode 237 | Linked List

Leetcode 237 Delete Node in a Linked List | Coding Decoded SDE Sheet

Delete Node in a Linked List | LeetCode 237 | Delete without Head Pointer | Programming Tutorials

Delete Node in a Linked List | Super Easy | Apple | Microsoft | Leetcode 237

Delete Node in a BST | LeetCode 952 | C++, Java, Python