Given a binary tree, the level order traversal for the tree would be each node at each level printed out left to right. For example, for the following tree, the level order would be 1 2 3 4 5. Each node has an integer element. 2 2 3 4 Given a binary tree, write an algorithm to print the level order of the tree. Write Java code (it's ok to make syntax errors but the code should be as close to as Java as possible). The method signature being: "public void printlevelOrderTraversal(BinaryNode node)