The PR will contain insertion, deletion and various traversals like in-order, pre-order, post-order traversal of binary search tree.