K5kC | Code & More

Computer Science

Algorithms Programming Languages Database System Design

Blind 75 Difficulty: Easy Difficulty: Medium Difficulty: Hard

Android Data Science Computer Vision Simulations

UUID Generator Code Formatter

Delete in a Binary Search Tree

medium Solve on LeetCode

Problem
Examples
Solution
Method 1 - Recursive + Finding inorder predecessor and successor
Node to Be Deleted is a Leaf Node (No Children)
Node to Be Deleted Has Only One Child
Node to Be Deleted Has Two Childrens
Code
Complexity
Method 2 - Iterative
Code
Complexity

Related Tags

binary-search-tree binary-tree bst-binary-search-tree delete_remove leetcode traversal/inorder

Privacy Disclaimer Report an Issue About

© 2026 K5kC | Code & More. All rights reserved.

चरैवेति चरैवेति | Keep moving on