Avoiding memory leaking when implementing a binary search tree

[Bubiche]

So I have a binary search tree with something like this

#include <iostream>
#include <string>
using namespace std;

struct Data
{
	string key;

	int* int_arr; //create a dynamically allocated array with this
	bool* bool_arr; //create a dynamically allocated array with this
};

struct Node
{
	Data* data; //pointer to data

	Node* pLeft;
	Node* pRight;
};

class BSTree
{
public:
	~BSTree()
	{
		empty(root);
	}

	void empty(Node* &cur)
	{
		if(cur)
		{
			empty(cur->pLeft);
			empty(cur->pRight);
			delete cur;
			cur = NULL; //<- is this necessary?
		}
	}
private:
	Node* root;
};

My question is, will the BSTree class' destructor deallocate the memory allocated for the data pointer and the dynamically allocated arrays as well? If not, how can I deallocate them to prevent memory leaking

Thank you for your time and patience

[coder777]

and the dynamically allocated arrays as well?

No

how can I deallocate them to prevent memory leaking

Add a destructor for Data where you delete its content.

If you'd have a destructor for Node you wouldn't need a function like empty(...). By the way data of Node isn't deleted either

EDIT: If you add a destructor you should add constructor as well to provide sane data

[mutexe]

or use these
http://en.cppreference.com/w/cpp/memory/unique_ptr

[Bubiche]

Thanks, you guys are the best