31
The in order traversal of tree will yield a sorted listing of elements of tree in....

Answer: Option [D]

Questions

31
The in order traversal of tree will yield a sorted listing of elements of tree in....

Answer: Option [D]

32
A binary tree whose every node has either zero or two children is called.........

Answer: Option [A]

33
The post order traversal of a binary tree is DEBFCA. Find out the pre order traversal

Answer: Option [C]

34
Three standards ways of traversing a binary tree T with root R .......

Answer: Option [D]

36
If a node having two children is deleted from a binary tree, it is replaced by its

Answer: Option [C]

40
The data structure required for Breadth First Traversal on a graph is

Answer: Option [A]