You have a tree, in which each node has an additional pointer, P. P can either be NULL or point a node preceding P’s node in the in-order traversal of the tree. Write a program to check in a tree if each node’s P is assigned correctly. If not, make P null
Thanks Shashank -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
