Home

All

Questions Type

The post-order traversal of a hypothetical binary tree is DEBFCA.What is the pre-order traversal?

Free

Multiple Choice

Answer:

Answer:

C

Which data structure allows deleting data elements from front and inserting at rear?

Multiple Choice

Answer:

When representing any algebraic expression E which uses only binary operations in a 2-tree,the variable in E will appear as external nodes and operations in internal nodes.

True False

Answer:

To represent hierarchical relationship between elements,which data structure is suitable?

Multiple Choice

Answer:

What are special pointers which point to nodes higher in a binary tree called?

Multiple Choice

Answer:

Which data structure allows deletions at both ends of a list but insertion only at one end?

Multiple Choice

Answer:

Which type of sort algorithm repeatedly steps through a list,comparing each pair of adjacent items and swapping them,if they appear in the wrong order?

Multiple Choice

Answer:

When converting a binary tree into an extended binary tree,all the original nodes become external on the extended tree.

True False

Answer: