In this paper, we have proposed an Incremental Sequential Pattern Tree mining algorithm to retrieve new updated frequent sequential patterns from dynamic sequence database. Sequential Pattern Tree stores both frequent and non-frequent items from the old sequence database. So that, our proposed algorithm updates the old Sequential Pattern Tree by scanning only the new sequences, does not require to scan the whole updated database (old + new) that reduces the execution time in reconstructing the tree. We have compared our proposed incremental mining approach with three existing algorithms those are GSP, PrefixSpan and FUSP-Tree Based mining and we have got satisfactory results.