Datastructures - Tree Traversals


Question 1     

What is Level order traversal equal to?






Question 2     

Which of the following is not a tree traversal?






Question 3     

What does the following code snippet do?






Question 4     

What is Depth First Search equals to?






Question 5     

What is common in three different types of traversals (Inorder, Preorder and Postorder)?







Question 6     

Which of the following pairs of traversals is not sufficient to build a binary tree from the given traversals?






Question 7     

The inorder and preorder traversal of a binary tree are 40 20 50 10 60 30 70 and 10 20 40 50 30 60 70, respectively. The postorder traversal of the binary tree is:






Question 8     

It is possible to construct a binary tree uniquely whose pre-order and post-order traversals are given.






Sign Up Page

Oops!!

To view the solution need to Login



Score : 0 / 0
L
o
a
d
i
n
g
.
.
.