0 votes
in C Programming by (45 points)
edited by
binary search tree deletion

Please log in or register to answer this question.

1 Answer

0 votes
by (15.0k points)

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.

Welcome to Sarthaks eConnect: A unique platform where students can interact with teachers/experts/students to get solutions to their queries. Students (upto class 10+2) preparing for All Government Exams, CBSE Board Exam, ICSE Board Exam, State Board Exam, JEE (Mains+Advance) and NEET can ask questions from any subject and get quick answers by subject teachers/ experts/mentors/students.