Association rule mining forms the core of data mining and it is termed as one of the well-researched techniques of data mining. It aims to extract interesting correlations, frequent patterns, associations or casual structures among sets of items in the transaction databases or other data repositories. Hence, Association rule mining is imperative to mine patterns and then generate rules from these obtained patterns. This paper provides the preliminaries of basic concepts about Itemset mining and survey the list of existing tree structure algorithms. These algorithms include various tasks such as fast query processing, optimizing memory space and reducing tree construction time. For mining maximal frequent pattern various algorithms used which optimization the search space for pruning.