A2 Q2

[Chris Jones]

Hello again,

When we are writing the functions to find the children and parent are
we to assume they exist?

Thanks,

[Doug Stinson]

Post by Chris Jones
Hello again,
When we are writing the functions to find the children and parent are
we to assume they exist?
Thanks,

You should check that they exist as part of your function description.
Doug Stinson.

[Kérberos Caelestius]

Post by Doug Stinson

Post by Chris Jones
Hello again,
When we are writing the functions to find the children and parent are
we to assume they exist?
Thanks,

You should check that they exist as part of your function description.
Doug Stinson.

I'm still unclear on this. Aren't these functions just going to
consume an index i and output some other index? How do we check if a
child exists, etc?

[Su Zhang]

Post by Kérberos Caelestius
I'm still unclear on this. Aren't these functions just going to
consume an index i and output some other index? How do we check if a
child exists, etc?

If a child does not exist, its associated index will be out of bound,
and this is already checked by the pseudocode in the slides.

[kun qian]

Post by Doug Stinson

Post by Chris Jones
Hello again,
When we are writing the functions to find the children and parent are
we to assume they exist?
Thanks,

You should check that they exist as part of your function description.
Doug Stinson.

I think it to check whether the node exist depends on implementation.
So I don't think the question should require the solution to check for
existence.

[chaolei]

Post by kun qian

Post by Doug Stinson

Post by Chris Jones
Hello again,
When we are writing the functions to find the children and parent are
we to assume they exist?
Thanks,

You should check that they exist as part of your function description.
Doug Stinson.

I think it to check whether the node exist depends on implementation.
So I don't think the question should require the solution to check for
existence.

so we are just need to write a mathematical function like heap we talk
on class, for example: the left child of A[i] is A[2i].
am I right?
thanks~

[cs240]

Yes, you are expected to write mathematical functions like the ones on
slide 53 (module 2). Whether the nodes exist or not should be a condition
that is included in your function description.

Vivian
CS240 Tutor

Post by kun qian

Post by Doug Stinson

Post by Chris Jones
Hello again,
When we are writing the functions to find the children and parent are
we to assume they exist?
Thanks,

You should check that they exist as part of your function description.
Doug Stinson.

I think it to check whether the node exist depends on implementation.
So I don't think the question should require the solution to check for
existence.

so we are just need to write a mathematical function like heap we talk on
class, for example: the left child of A[i] is A[2i].
am I right?
thanks~