please I need it urgent thank in c++

6. Write a function replace that that takes two values, tsndVal and repVal, and replaces each instance of tindVal in a binary tree rooted at nd with repVal. Return how many instances of findVal were found. You can write this recursively or iteratively (recall the skeleton code for traversing a tree, think about what "work" is being done at each node). Assume structure node has members T val and nodecT* left, right. template int replace (nodecT nd, const T& findVal, const T& repVal)