An Enhanced Bubble Sorting Algorithm with Divide and Conquer Approach Leads to the Construction of Balanced Search Tree
Abstract
Keywords
Full Text:
PDFReferences
S. Muthusundari and R. M. Suresh, “ Sorting Based Divide and Conquer Approach Leads to the Automatic Construction of Balanced Tree from BST”, National Conference on Advances in Computing and Technology(NCACT-2013), 15th March – 2013,Published by CIIT.
Adel’son-Vel’skii, G.M., and Landis, E.M., 1962, An Algorithm for the Organization of information. Soviet Mathematics Doklady, 3, pp.1259–1263.
John Michael Robson. Constant bounds on the moment of the height of binary search trees. Theoretical Computer Science, 276(1–2):435–444, 2002.
Chang, H., and Iyengar S.S., July 1984, Efficient Algorithms To Globally Balance a Binary Search Tree Communication of the ACM 27, 8, pp. 695-702.
Day, A. C., 1976, Balancing a Binary Tree, Computer Journal, XIX, pp. 360-361.
Martin, W.A., and Ness, D.N., Feb 1972, Optimal Binary Trees Grown with a Sorting Algorithm. Communication of the ACM 15, 2, pp. 88-93.
Sleator, D.D., and Tarjon R. E., July 1985, Self-Adjusting Binary Search Trees. Journal of The ACM, 32(3), pp. 652-686.
Stout, F., and Bette, L. W., September 1986, Tree Rebalancing in Optimal Time and Space, Communication of the ACM, Vol. 29, No. 9, pp. 902-908.
Donald E. Knuth. Sorting and Searching, volume 3 of The Art of Computer Programming. Addison-Wesley, 2nd edition, 1998.
Bodo Manthey and R¨udiger Reischuk. Smoothed analysis of binary search trees. Theoretical Computer Science, 378(3):292–315, 2007.
Bruce Reed. The height of a random binary search tree. Journal of the ACM, 50(3):306–332, 2003.
Refbacks
- There are currently no refbacks.