Logo 
Search:

Java Answers

Ask Question   UnAnswered
Home » Forum » Java       RSS Feeds
  Question Asked By: Don Sims   on Jan 22 In Java Category.

  
Question Answered By: Andrew Bryant   on Jan 22

Tree-Delete (T, x)

if x has no children case 0

then remove x

if x has one child  case 1

then make p[x] point to child

if x has two children case 2

then swap x with its successor

perform case 0 or case 1 to delete it

Share: 

 

This Question has 1 more answer(s). View Complete Question Thread

 
Didn't find what you were looking for? Find more on Implement a binary search tree using Nodes Or get search suggestion and latest updates.


Tagged: