1.

binary search tree deletion

Answer»

Deletion in a Binary Tree

  1. Algorithm.
  2. Starting at root, find the deepest and rightmost node in binary tree and node which we want to delete.
  3. Replace the deepest rightmost node's data with node to be deleted.
  4. Then delete the deepest rightmost node.


Discussion

No Comment Found

Related InterviewSolutions