A tree is a non-linear data structure for fast storing and retrieval of data in primary memory. It represents data in the form of hierarchical form. Data are stored in a tree i.e. called as a node, in which topmost node is called root and each node has one or more nodes lying on the left or right side of a tree. Except for root node each node has a parent node. The information can be extracted from a tree through various traversal algorithms. Tree traversal means visiting the nodes of a tree at once. In this paper, we are studying different algorithms for tree traversal