Binary Search Tree - Deletion Pseudo Code

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

Video 68 of a series explaining the basic concepts of Data Structures and Algorithms.

This video explains the pseudo code for deletion from a binary search tree.

This video is meant for educational purposes only.

Lalitha Natraj

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

Комментарии

What about the case where we want to delete the root node, getParent will return null, we need to handle that manually

sumanth

Well structured explanation, great job!

dreamzsiva

node ret=x???
what is ret why we are returning it

virajgavas

if you are making i.left=x.left and i.right=x.right for two child then redundancy arises. please go through that and correct it.

nature-world

I think you need to remove Node i as well in the case of TwoChild(). As you have replaced the data of the node to be deleted with the other node, but the other node is still present in the tree. U need to delete that node as well.

robinck

Tq for helping me in the exam point of view

akulaakanksha

Not all of the cases were covered in the video! Assume we have node 15 which is the right sub-tree of the root 10. Assume 15 has a left child 13. And assume it has a right child 21. Furthermore, 21 has a left child 19 and right child 25. Lastly, 19 has a right child 20. If you are reading this, I encourage you to draw out this tree. Here is the case this video did not cover: if you want to delete the node 15, then what you are doing is setting the parent's left or right to the new successor (in this case, setting root's right to the successor). In this example, the successor is 19. Then you are setting the successor's left and right child to the left and right child of x (x is the node we want to delete). However, successor had a right child (20) and you replaced that with the x's right child.

tarakhanal

15.29...we replace x node with i node..
children of x will become children of i...
what about children of i?
they will be lost...

ms-lkbw

If question is give write an algorithm to delete binary search tree can we write pseudo code in the place algorithm

mohammedabrarahmed

Binary Search Tree - Deletion Pseudo Code

Delete a node from Binary Search Tree

Binary Search Tree: Deletion Overview

Delete Node in a BST - Leetcode 450 - Python

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

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

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

C Code For Deletion in a Binary Search Tree

Binary Search Tree | Set 2 (Delete) | GeeksforGeeks

Deletion in a Binary Search Tree

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

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

Binary Search Tree - Deletion Pseudo Code

Search and Delete in Binary Search Tree | C++ Placement Course | Lecture 28.2

Binary Search Tree - Deletion

Python Program To Implement Binary Search Tree | Program 6 | Deletion | Example

Binary Search Tree in Java - 2: Delete a node of binary search tree

Deletion Operation on Binary Search Tree | Part-1 | Data Structures using C

6.4.3 Delete BST/ Deletion in Binary Search Tree (iterative method)

Leetcode - Delete Node in a BST (Python)

Add and Remove from Binary Search Trees

Deletion of a Node from BST With Two Children

Delete in Binary Search Tree (BST) in Data Structure Hindi | Example

Binary Search Trees Deletion Examples | Deleting a node from BST | Data Structure

6.4 How to do Deletion in Binary Search Tree?