Question

Consider the following binary tree:       5      / \     3   8    / \ / \   1  4 6  9 What is the output of an Inorder Traversal (Left, Root, Right) for this tree?

A 5 3 1 4 8 6 9
B 1 3 4 5 6 8 9
C 1 4 3 6 9 8 5
D 5 3 8 1 4 6 9
E 1 3 5 4 8 6 9
Practice Next

Hey! Ask a query