Data Structures C Binary Search Trees Someone Explain 2 Different Codes Line Line Understa Q37165998

Data Structures with C++: Binary Search TreesCan someone explain these 2 different codes line by line so Ican understand what they are both doing.
3:00 PM Sun Apr 21 Data Structures template <class T> BSTNode<T* BSTree<T>: search(T val) return recursiveSearch(root, val); ) template <class T> BSTNode<T BSTree<T: recursiveSearch(BSTNode<T>*node, T val) BSTNode<T> *res;//function result res-0; //default value if (nodel-0) if (valnode->getlnfo) //Node

OR

 

OR