public BSTNode findp(BSTNode child) {
		BSTNode parent = null;
		BSTNode auxRoot = root;
		while (auxRoot != null) {
			if (auxRoot.data == child.data)
				return parent;
			if (child.data < auxRoot.data) {
				parent = auxRoot;
				auxRoot = auxRoot.left;
			}
			else {
				parent = auxRoot;
				auxRoot = auxRoot.right;
			}
		}
		return null;
	}