small dfs project, c++, ASAP

Node interface is provided in file, you should put it in a separate Node.h, and a Node.cpp to implement the node interface. Your task: use BST to implement public constructor,JltFinder(std::shared_ptr<Node>); , which receives the root of the binary search tree over which to search, and std::shared_ptr<Node> Find(int); that search for the node with the value closest to but less than the value provided.