how I can print the pre-order, post-order, and in-order elements with its frequency.
Hello there,
I have to write a Binary Search Tree program in Java that has to insert, delete, search, find max, find min, printing the elements in Binary Search Tree in pre-order, post-order, and in-order.
But I am struggling to understand how I can print the pre-order, post-order, and in-order elements with its frequency.
Can someone help me with the question I have, please?
Question:
Printing an element: An element from the BST will always be printed along with its frequency. For example, if there is a node in the BST that contains the element −7, and its frequency is presently recorded as 2, the data in the node will be printed as
−7(2)
Another example: 1 100 1 50 1 50 1 100 1 100 5 6 0
Output: 100(3)50(2)50(2)100(3)
Hope someone can help me understand the coding, please :)
Thank you.
Step by step
Solved in 2 steps
