C++/BehaviorTreesLib/Root.cpp
Node * Root::copy()
	{
		Root* newNode = new Root();
		newNode->addChild(((this->mChild)->copy()));
		return newNode;
	}
// Perform deep copy of tree and return a pointer to the new tree
Perform deep copy of tree and return a pointer to the new tree
Perform deep copy of tree and return a pointer to the new tree
Node * Root::copy()
	{
		Root* newNode = new Root();
		newNode->addChild(((this->mChild)->copy()));
		return newNode;
	}
Node * Root :: copy ( ) { Root * newNode = new Root ( ) ; newNode -> addChild ( ( ( this -> mChild ) -> copy ( ) ) ) ; return newNode ; }
Perform deep copy of tree and return a pointer to the new tree
Perform deep copy of tree and return a pointer to the new tree