What does the following piece of code do?
public void func(Tree root)
{
func(root.left());
func(root.right());
System.out.println(root.data());
}
public void func(Tree root)
{
func(root.left());
func(root.right());
System.out.println(root.data());
}A. Preorder traversal
B. Inorder traversal
C. Postorder traversal
D. Level order traversal
Answer: Option C
This Question Belongs to Data Structure >> Binary Search Trees(B Tree)
Join The Discussion