• LALIT KUMAR SAINI
• DEEPAK VERMA

ABSTRACT: Searching is the important & core task in computers. Efficient searching of data is always the main concern. The data structure which accelerate the searching is hashing methods. There we generally do insert, delete and search data with some key. This key is generated by the some of the appropriate hash function i.e. mid square method, folding method etc. The problem of Collision in hashing occurs generally, for that so many data structures (methods) are used like chaining, addressing methods. This paper first analyzes the separate chaining method additionally with upgraded approaches ie chaining with balanced binary trees like BST and AVL. Some algorithms are also given to help in implementation for improving the performance of separate chaining and decreases the time of searching when element is searched.

Data Structure, Hashing, Separate Chaining, Binary Search Tree, AVL Tree

"Algorithmic analysis of advancement in chaining method with BST & AVL ", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.6, Issue 5, page no.183-188, May-2019, Available :http://www.jetir.org/papers/JETIR1905629.pdf

"Algorithmic analysis of advancement in chaining method with BST & AVL ", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.6, Issue 5, page no. pp183-188, May-2019, Available at : http://www.jetir.org/papers/JETIR1905629.pdf