Data Structures
1 solved question
- Implement deletion in a binary search tree
Deletion replaces a two-child node with its in-order successor. Average time is O(log n) and the worst case is O(n).
Deletion replaces a two-child node with its in-order successor. Average time is O(log n) and the worst case is O(n).