On 6/8/06, Sriram narasimhan [EMAIL PROTECTED] wrote:
hi ankur,
Thanks for sending me the link but the greedy algorthms are not
opening...wat should i do now...
maybe you should try to understand why ...
Greetings.
Mattia Merzi.
1. Yes
2. Inorder Predecessor of a node(A) is the node(B) which appears before this node(A) in the inorder traversal.
If the current node has left child thenthe left childis the inorder predecessor.
If it does not have the left child traverse the parent(Y) until theparent node(Y) is the right
I think its the right most element of the left sub-tree and not the left child itself, if the node has a left child.and if it doesn't have a left child then travers up towards the root. the first node x you hit which is the right child of its parent, then parent(x) is the answer.
and I agree with
Sriram narasimhan wrote:
hi everyone,
1.Can topological sorting be stated as an application of
depth first search(DFS)...
Yes. If you perform DFS on a DAG and consider the vertices
in reverse postorder, this is a topological order.
Dear sir,
I m Sriram doing my first year ENGG at Hindustan college of Engg,chennai,India. Actually im interested in attending the WORLDCOMP'06 but due to the semester examinations i would not be attending the programme.Thanks
a lot for your invitation.I look forward to attend the seminars next
The genesis for the idea began with the site CardShark [1], which
allows private sellers to sell cards for collectible card games. At
this site, if you buy 1 - 3 cards from a single seller, it costs you
$1.30 in shipping. 4 - 7 cards costs you $1.60, and each additional
fraction of 8 cards
