Answer Happy

COURSE: DATA STRUCTURE & ALGORITHM
Show the working for the traverse properly for the given
Question below
INSTRUCTION FOR THE GIVEN QUESTION:
1) First, you have to make a tree from the given data
2) Secondly, you have to traverse that tree using the given code
below
3) Thirdly, After Traversing the tree you have to write
the Inorder_traversed data
18 points Using the code below traverse following data: 50, 48, 23, 7, 2, 5, 19, 22, 15, 6, 25, 13, 45 7 void printReverseorder(Node node) { if (node == null) return; printReverseInorder(node.right) printReverseInorder(node.left); System.out.print(node.key+""); }