From 2bdb308c457617154ec611a788b4ddb42cbec0f6 Mon Sep 17 00:00:00 2001
From: Majidzadeh <hashpragmaonce@gmail.com>
Date: Thu, 16 Apr 2020 16:20:08 +0430
Subject: [PATCH] Fix BinaryTree<Node>::bfTraverse

Done by making q ArrayDeque behave like a queue
---
 cpp/BinaryTree.h | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/cpp/BinaryTree.h b/cpp/BinaryTree.h
index 16b83208..8e80a8de 100644
--- a/cpp/BinaryTree.h
+++ b/cpp/BinaryTree.h
@@ -181,7 +181,7 @@ void BinaryTree<Node>::bfTraverse() {
 	ArrayDeque<Node*> q;
 	if (r != nil) q.add(q.size(),r);
 	while (q.size() > 0) {
-		Node *u = q.remove(q.size()-1);
+		Node *u = q.remove(0);
 		if (u->left != nil) q.add(q.size(),u->left);
 		if (u->right != nil) q.add(q.size(),u->right);
 	}