diff --git a/test/blobstore/implementations/onblocks/datatreestore/DataTreeTest_ResizeByTraversing.cpp b/test/blobstore/implementations/onblocks/datatreestore/DataTreeTest_ResizeByTraversing.cpp
index 9301d0e5..18c98849 100644
--- a/test/blobstore/implementations/onblocks/datatreestore/DataTreeTest_ResizeByTraversing.cpp
+++ b/test/blobstore/implementations/onblocks/datatreestore/DataTreeTest_ResizeByTraversing.cpp
@@ -168,7 +168,7 @@ TEST_P(DataTreeTest_ResizeByTraversing_P, StructureIsValid) {
   EXPECT_IS_LEFTMAXDATA_TREE(tree->key());
 }
 
-TEST_P(DataTreeTest_ResizeByTraversing_P, NumBytesIsCorrect) {
+TEST_P(DataTreeTest_ResizeByTraversing_P, NumLeavesIsCorrect) {
   GrowTree(tree.get(), numberOfLeavesToAdd);
   // tree->numLeaves() only goes down the right border nodes and expects the tree to be a left max data tree.
   // This is what the StructureIsValid test case is for.
diff --git a/test/blobstore/implementations/onblocks/datatreestore/DataTreeTest_ResizeNumBytes.cpp b/test/blobstore/implementations/onblocks/datatreestore/DataTreeTest_ResizeNumBytes.cpp
index 586627fe..520752a9 100644
--- a/test/blobstore/implementations/onblocks/datatreestore/DataTreeTest_ResizeNumBytes.cpp
+++ b/test/blobstore/implementations/onblocks/datatreestore/DataTreeTest_ResizeNumBytes.cpp
@@ -176,6 +176,14 @@ TEST_P(DataTreeTest_ResizeNumBytes_P, NumBytesIsCorrect) {
   EXPECT_EQ(newSize, tree->numStoredBytes());
 }
 
+TEST_P(DataTreeTest_ResizeNumBytes_P, NumLeavesIsCorrect) {
+  tree->resizeNumBytes(newSize);
+  tree->flush();
+  // tree->numLeaves() only goes down the right border nodes and expects the tree to be a left max data tree.
+  // This is what the StructureIsValid test case is for.
+  EXPECT_EQ(newNumberOfLeaves, tree->numLeaves());
+}
+
 TEST_P(DataTreeTest_ResizeNumBytes_P, DepthFlagsAreCorrect) {
   tree->resizeNumBytes(newSize);
   tree->flush();