int traverse ( ) counter =0 if tree is not empty (root is not null) create an empty queue queue.add( the root of this tree) while queue is not empty current = queue. remove() print current. data if current has a right child queue.add( right child) if current has a left child queue.add( left child) What is printed by this function when it is called on the tree shown below? ACBGFEDKJH DHIEBJFKGCA if current has a left child return What is printed by this function when it is called on the tree shown below? ACBGFEDKJIH DHIEBJFKGCA ABDEHICFJGK ABCDEFGHIJK HIJKDEFGBCA ACGKGJBEIHD DBHEIAFJCKG