×
INTELLIGENT WORK FORUMS
FOR COMPUTER PROFESSIONALS

Contact US

Log In

Come Join Us!

Are you a
Computer / IT professional?
Join Tek-Tips Forums!
  • Talk With Other Members
  • Be Notified Of Responses
    To Your Posts
  • Keyword Search
  • One-Click Access To Your
    Favorite Forums
  • Automated Signatures
    On Your Posts
  • Best Of All, It's Free!

*Tek-Tips's functionality depends on members receiving e-mail. By joining you are opting in to receive e-mail.

Posting Guidelines

Promoting, selling, recruiting, coursework and thesis posting is forbidden.

Students Click Here

Write Prolog code which will perform a postorder traversal

Write Prolog code which will perform a postorder traversal

Write Prolog code which will perform a postorder traversal

(OP)
    tree constant.   Hint: you might use 'univ', or its cousins.
?- postorder(a(b,c,d(e,f,g))).
     b c e f g d a    true
     


Hi ,
I am trying this problem but , the output is undefined predicate postorder. I think i wrote correctly but, it is not working.
postorder(void,[]).
postorder(tree(X,L,R),Xs):-
postorder(L,Ls),postorder(R,Rs),append(Rs,[X],Rs1),append(Ls,Rs1,Xs).


can anyone please help me. Urgent...:(

Thank you.

Red Flag This Post

Please let us know here why this post is inappropriate. Reasons such as off-topic, duplicates, flames, illegal, vulgar, or students posting their homework.

Red Flag Submitted

Thank you for helping keep Tek-Tips Forums free from inappropriate posts.
The Tek-Tips staff will check this out and take appropriate action.

Reply To This Thread

Posting in the Tek-Tips forums is a member-only feature.

Click Here to join Tek-Tips and talk with other members! Already a Member? Login


Close Box

Join Tek-Tips® Today!

Join your peers on the Internet's largest technical computer professional community.
It's easy to join and it's free.

Here's Why Members Love Tek-Tips Forums:

Register now while it's still free!

Already a member? Close this window and log in.

Join Us             Close