Complete the function find in BTreeNode.cpp that accepts a BTreeNode * and an int val, and must return the BTreeNode * that contains the matching val, or NULL if val was not found. ## BTreeNode.h##

#ifndef BTREENODE_H #define BTREENODE_H

#include #include #include

struct BTreeNode { bool is_leaf_=true; std::vector elements_; std::vector children_; BTreeNode() {} BTreeNode (std::vector v) { this->elements_ = v; } };

BTreeNode* find(BTreeNode* root, int key);

#endif

## BTreeNode.cpp ##

#include #include "BTreeNode.h"

BTreeNode* find(BTreeNode* root, int key) { // Code Here int i = 1; return NULL; }