diff --git a/test/implementations/onblocks/datatreestore/DataTreeStoreTest.cpp b/test/implementations/onblocks/datatreestore/DataTreeStoreTest.cpp
index 5410776b..5ec1082f 100644
--- a/test/implementations/onblocks/datatreestore/DataTreeStoreTest.cpp
+++ b/test/implementations/onblocks/datatreestore/DataTreeStoreTest.cpp
@@ -30,7 +30,7 @@ TEST_F(DataTreeStoreTest, TreeIsNotLoadableAfterRemove) {
 }
 
 TEST_F(DataTreeStoreTest, RemovingTreeRemovesAllNodesOfTheTree) {
-  auto key = CreateFullThreeLevel()->key();
+  auto key = CreateThreeLevelMinData()->key();
   auto tree1 = treeStore.load(key);
   auto tree2_key = treeStore.createNewTree()->key();
 
diff --git a/test/implementations/onblocks/datatreestore/shrinking/testutils/DataTreeShrinkingTest.cpp b/test/implementations/onblocks/datatreestore/shrinking/testutils/DataTreeShrinkingTest.cpp
index 9efe02ed..0cfbcfd3 100644
--- a/test/implementations/onblocks/datatreestore/shrinking/testutils/DataTreeShrinkingTest.cpp
+++ b/test/implementations/onblocks/datatreestore/shrinking/testutils/DataTreeShrinkingTest.cpp
@@ -30,13 +30,6 @@ unique_ptr<DataInnerNode> DataTreeShrinkingTest::CreateTwoInnerNodeTwoOneLeaves(
   });
 }
 
-unique_ptr<DataInnerNode> DataTreeShrinkingTest::CreateThreeLevelMinData() {
-  return CreateInner({
-    CreateFullTwoLevel(),
-    CreateInner({CreateLeaf()})
-  });
-}
-
 unique_ptr<DataInnerNode> DataTreeShrinkingTest::CreateFourLevelMinData() {
   return CreateInner({
     CreateFullThreeLevel(),
diff --git a/test/implementations/onblocks/datatreestore/shrinking/testutils/DataTreeShrinkingTest.h b/test/implementations/onblocks/datatreestore/shrinking/testutils/DataTreeShrinkingTest.h
index 9f1e90f6..166decff 100644
--- a/test/implementations/onblocks/datatreestore/shrinking/testutils/DataTreeShrinkingTest.h
+++ b/test/implementations/onblocks/datatreestore/shrinking/testutils/DataTreeShrinkingTest.h
@@ -16,7 +16,6 @@ public:
   std::unique_ptr<blobstore::onblocks::datanodestore::DataInnerNode> CreateFourNodeThreeLeaf();
   std::unique_ptr<blobstore::onblocks::datanodestore::DataInnerNode> CreateTwoInnerNodeOneTwoLeaves();
   std::unique_ptr<blobstore::onblocks::datanodestore::DataInnerNode> CreateTwoInnerNodeTwoOneLeaves();
-  std::unique_ptr<blobstore::onblocks::datanodestore::DataInnerNode> CreateThreeLevelMinData();
   std::unique_ptr<blobstore::onblocks::datanodestore::DataInnerNode> CreateFourLevelMinData();
   std::unique_ptr<blobstore::onblocks::datanodestore::DataInnerNode> CreateFourLevelWithTwoSiblingLeaves1();
   std::unique_ptr<blobstore::onblocks::datanodestore::DataInnerNode> CreateFourLevelWithTwoSiblingLeaves2();
diff --git a/test/implementations/onblocks/datatreestore/testutils/DataTreeTest.cpp b/test/implementations/onblocks/datatreestore/testutils/DataTreeTest.cpp
index 60ca2c1f..3ef62831 100644
--- a/test/implementations/onblocks/datatreestore/testutils/DataTreeTest.cpp
+++ b/test/implementations/onblocks/datatreestore/testutils/DataTreeTest.cpp
@@ -68,6 +68,13 @@ unique_ptr<DataInnerNode> DataTreeTest::CreateFullTwoLevel() {
   return root;
 }
 
+unique_ptr<DataInnerNode> DataTreeTest::CreateThreeLevelMinData() {
+  return CreateInner({
+    CreateFullTwoLevel(),
+    CreateInner({CreateLeaf()})
+  });
+}
+
 unique_ptr<DataInnerNode> DataTreeTest::CreateFullThreeLevel() {
   auto root = CreateInner({CreateFullTwoLevel().get()});
   FillNodeTwoLevel(root.get());
diff --git a/test/implementations/onblocks/datatreestore/testutils/DataTreeTest.h b/test/implementations/onblocks/datatreestore/testutils/DataTreeTest.h
index 1284d7f7..02fe4c82 100644
--- a/test/implementations/onblocks/datatreestore/testutils/DataTreeTest.h
+++ b/test/implementations/onblocks/datatreestore/testutils/DataTreeTest.h
@@ -27,6 +27,8 @@ public:
   std::unique_ptr<blobstore::onblocks::datanodestore::DataInnerNode> CreateFullTwoLevel();
   std::unique_ptr<blobstore::onblocks::datanodestore::DataInnerNode> CreateFullThreeLevel();
 
+  std::unique_ptr<blobstore::onblocks::datanodestore::DataInnerNode> CreateThreeLevelMinData();
+
   std::unique_ptr<blobstore::onblocks::datanodestore::DataInnerNode> LoadInnerNode(const blockstore::Key &key);
   std::unique_ptr<blobstore::onblocks::datanodestore::DataLeafNode> LoadLeafNode(const blockstore::Key &key);