Binary Search Tree - Deletion

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

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

This video explains deletions from a binary search tree.

This video is meant for educational purposes only.

Lalitha Natraj

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

Комментарии

case 3 is not correct, if 6 has 2 child (left, right), for example, 5.9 and 6.1. the right way is to find min value of right tree (5.9), replace it with deleted node (replace 5 with 5.9), then call recursive to delete min value (5.9) on right tree (which is back to case 2)

ongxa

Nice explanation!
Before watching, I was always unsure, rather it is necessary to delete the data inside the node, which we want to delete... But as it seems it is enough, when we just remove the pointer/reference to the node, which we want to delete.(For example in case 1)
As the garbage collector will do the rest.

kevinegal

Your videos are really easy to understand. Hats off. I build of Binary tree and implemented all operations on my own. Thanks

codewithkolhar

What if, when deleting 5 and replacing it with 6, if the node 6 also had children, what do we do?

sunnythegreat

Hello Lalitha, I loved your explanation about deletion, for sure was the best video for me to understand that. Thank you for posting that :)

_paulacr

Thank you for the clear, and simple explanation! Seems like most tutorials cannot explain it this easily.

dinnerchiahao

Very clear explanation. Great job . That's a bunch !

AI-AF-

thank you so much for your amazing helpful simple easy explanation, please keem. making these videos ❤️

mohammadahmedragab

Thank you very much madam. It is very good to explain your lesson & I like your explanation ❤️

theekshani

Thanks for your knowledge based class mam

chinnikrishna

Thank you very much, I like your explanation

toheebajayi

Mam case 3 is not right LEFT MOST ELEMENT IN RIGHT SUBTREE REVIEW IT PLZ

ultimatefitness

Thanks for the video! I screenshotted this!

kristofk

inorder successor of 5 is 4 not 6!

the inorder successor element of its right subtree!

BlackWolF_

What if the 6 in case 3 already has 2 children?

paulr

Becouse in binary search tree right side last node is greater than

Pc_talk

Please make a video in linked list insertion deletion

manikantareddy

What if 6 has its two children. Then where the left child of 6 goes after performing deletion .

nishanttomar

U r voice awesome maam....💞 and great

skborton

Binary Search Tree - Deletion

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

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

Deletion in a Binary Search Tree

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

Binary Search Tree - Deletion

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

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

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

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

Leetcode - Delete Node in a BST (Python)

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

Deletion of a Node from BST With Two Children

Add and Remove from Binary Search Trees

6.4 How to do Deletion in Binary Search Tree?

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

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