simple algo.. : let we have to find leftmost right cousin of x! >> try to get an ancestor of the node x such that x lies in left subtree of that ancestor , and count no of levels , say L, u moved to get that ancestor..now start from that ancestor to get left most node IN THE RIGHT SUBTREE , by going down L levels... that might be ur answer... correct me , if i m wrong!
-- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To view this discussion on the web visit https://groups.google.com/d/msg/algogeeks/-/agOYaDD33H0J. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
