Solutions of Theory of Algorithms assignment2

Solutions of Theory of Algorithms assignment2 - root list):...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Solutions of Theory of Algorithms assignment 2 Exercise 20.2-1 Return the node with key 7. Delete the node and link its children sub trees to the root list as follows (circles are the
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: root list): Then min[H] = 18, A[0]=0, A[1]=38, A[2]=18, A[3]=0 A[0]=0, A[1]=38, A[2]=0, A[3]=18 A[0]=23, A[1]=0, A[2]=17, A[3]=18...
View Full Document

This note was uploaded on 11/07/2010 for the course CS 11841 taught by Professor Dr.ayman during the Spring '09 term at Alexandria University.

Ask a homework question - tutors are online