Ok lemme add some more details to it. See it is a kind of n-ary tree having n=4 and each pointer is represented as left, right,top and bottom compare it to the four directions.
So the shortest path starting from the root node to the leaf node where the val = 1000, taken into consideration there will be only one node which has the val =1000 needs to discovered. On Tue, Jun 14, 2011 at 6:06 PM, sunny agrawal <[email protected]>wrote: > same as left right or top > u can consider as each node as a cell of grid type of thing for easy > understanding > > On Tue, Jun 14, 2011 at 5:59 PM, vaibhav agarwal < > [email protected]> wrote: > >> What actually is meant by bottom pointer >> >> >> On Tue, Jun 14, 2011 at 5:57 PM, sunny agrawal >> <[email protected]>wrote: >> >>> Did you mean Shortest path from one node to another >>> Use BFS i think we can find the shortest path >>> >>> >>> >>> On Tue, Jun 14, 2011 at 5:37 PM, Raghavan <[email protected]> wrote: >>> >>>> Hi, >>>> How to find the shortest path in a 4-ary tree in an optimal way? >>>> >>>> Node tree{ >>>> Node *left,*right,*top,*bottom; >>>> int val; >>>> }; >>>> >>>> Let the above given be the tree structure. >>>> >>>> -- >>>> Thanks and regards, >>>> Raghavan.K.L >>>> <http://in.linkedin.com/in/raghavankl> >>>> >>>> -- >>>> You received this message because you are subscribed to the Google >>>> Groups "Algorithm Geeks" group. >>>> 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. >>>> >>> >>> >>> >>> -- >>> Sunny Aggrawal >>> B-Tech IV year,CSI >>> Indian Institute Of Technology,Roorkee >>> >>> >>> -- >>> You received this message because you are subscribed to the Google Groups >>> "Algorithm Geeks" group. >>> 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. >>> >> >> -- >> You received this message because you are subscribed to the Google Groups >> "Algorithm Geeks" group. >> 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. >> > > > > -- > Sunny Aggrawal > B-Tech IV year,CSI > Indian Institute Of Technology,Roorkee > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > 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. > -- Thanks and regards, Raghavan.K.L <http://in.linkedin.com/in/raghavankl> -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. 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.
