Sorry for the second question. I've misread the problem and assumed that you have an array instead of BST. Locate minimum element in the tree - the leftist one in the tree. Then run 4 iterations for finding successors of the node. To do this you need to keep track link to the parent of the node. However, you can easily find 4-th smallest element using inorder traversal.
On Nov 3, 10:56 pm, kanika suri <surfatheig...@gmail.com> wrote: > Thanx 4 rply but not getin ur solutions. > 1.cn u gve easy algorithm(python dify to undrstand) > 2.how to run selection sort on BST,BST has some different structure(dese > algos run on arrays ).cn u gve code in C for undrstanding. > > -- > regards > kanika suri > MCS 2nd yr > DUCS > University of Delhi -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@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.
