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

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

**** Best Books For Data Structures & Algorithms for Interviews:**********
*****************************************************************************

August LeetCoding Challenge | Problem 31 | Delete Node in a BST | 31 August,
Facebook Coding Interview question,
google coding interview question,
leetcode,
Delete Node in a BST,
Delete Node in a BST c++,
Delete Node in a BST Java,
Delete Node in a BST python,
Delete Node in a BST solution,
450. Delete Node in a BST,

#CodingInterview #LeetCode #AugustCodingChallenge #Google #Amazon #bst #Trees #BinaryTree

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

Комментарии

After seeing the way you explained, I have subscribed with love

saranguru

Thank you very much.. Superb explanation

sharifmansuri

Thanks so much. This is a really hard problem. It is always the hard part to delete something in a tree. Your explanation was amazing. I hope you can fullfill your dream and someday work in Google.

ChristianESL

Very well explained! Thank you for making it so easier.

shaziakaleem

The given BST is incorrect as 9 should be placed right of 8 not in the left. If we take inorder of the given BST, it won’t be in ascending order.
Inorder: 4, 7, 9, 8, 10, 12
Which is incorrect

gauravchandel

If we need to balance the tree after deletion . How can we do it??

ragavkishoreg

Hi, don't you think the given BST in the example is wrong. 8 should be in place of 7 and 7, 4 should be left of 8?

rohithchandra

NOTE : LEFT SUBTREE OF node 8 is 9, how ?? @Knowledge Center

The example you discussed in the whole video even is not a BST. It might be a mistake, I noticed & hence informing. Hope it helps other students to not get a misconception about the properties of BST.

Binary Search Tree is a node-based binary tree data structure that has the following properties:

The left subtree of a node contains only nodes with keys lesser than the node’s key.
The right subtree of a node contains only nodes with keys greater than the node’s key.
The left and right subtree each must also be a binary search tree.

rahuljain

sir which software you use for writing .

himanshupatel

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

Delete Node in a BST - Leetcode 450 - Python

Delete a node from Binary Search Tree

Binary Search Tree: Deletion Overview

L44. Delete a Node in Binary Search Tree | BST | C++ | Java

Leetcode - Delete Node in a BST (Python)

Delete a node from Binary Search Tree( Reason for every operation explained)

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

[Java] Leetcode 450. Delete Node in a BST [Binary Search Tree #5]

Delete the Root of a Binary Search Tree (AVL) #short #computerscience #algorithm #graph

Binary Search Tree - Deletion

Delete node from Binary Search Tree #DataStructures

Delete a Node in BST | Deletion in BST | Delete a Node in Binary Search Tree | DSA-One Course #68

Delete Node Operation in Binary Search Tree (BST) | Working + Pseudocode (With Full C++ Code) | DSA

Lec-54: Deletion from Binary Search Tree(BST) with Example | Data Structure

Binary Search Trees - Deleting Nodes - Part 2 - C++ - How to Delete Nodes from a Binary Search Tree

Delete ANY Node in a Binary Search Tree LIKE A PRO LeetCode 450. Delete Node in a BST in Python

How to Delete a Node from a Binary Search Tree

How to Remove Node in BST - Solution | Binary Search Tree | Data Structure and Algorithms in JAVA

Binary search tree delete a node.BST deleting a node.

Delete A Node In BST | LeeCode August Challenge (Day31) | Leetcode 450

Delete Node In A BST Leetcode Python

Delete Node in a Binary Search Tree | LeetCode 450. Delete Node in a BST LeetCode | Coding Interview

Delete a node from Binary Search Tree | BST

How to Delete Node in Binary Search Tree (BST)