From 9a129dca1e663d1364463f7af383c649a76aa6d4 Mon Sep 17 00:00:00 2001
From: Mathias Agopian <mathias@google.com>
Date: Tue, 21 Aug 2018 23:31:23 -0700
Subject: [PATCH] improve BinaryTreeArray unit test

make sure we visit children before the parents.
---
 libs/utils/test/test_BinaryTreeArray.cpp | 9 ++++++---
 1 file changed, 6 insertions(+), 3 deletions(-)

diff --git a/libs/utils/test/test_BinaryTreeArray.cpp b/libs/utils/test/test_BinaryTreeArray.cpp
index 5e99f82e11..e570063db1 100644
--- a/libs/utils/test/test_BinaryTreeArray.cpp
+++ b/libs/utils/test/test_BinaryTreeArray.cpp
@@ -24,16 +24,19 @@ TEST(BinaryTreeArray, basic) {
 
 
     struct Node {
-        size_t index;
-        size_t next;
+        size_t index = 0;
+        size_t next = 0;
+        bool visited = 0;
     };
     Node array[256];
 
     BinaryTreeArray::traverse(1,
             [&array](size_t index, size_t col, size_t next) {
-                array[index] = Node{ index, next };
+                array[index] = Node{ index, next, true };
             },
             [&array](size_t index, size_t l, size_t r, size_t next) {
+                EXPECT_TRUE(array[l].visited);
+                EXPECT_TRUE(array[r].visited);
                 array[index] = Node{ index, next };
             });