| | | | Question Answer Tutorial - Computer Science->Data Structure | | | | Question: When inorder traversing a tree resulted E A C K F H D B G; the preorder traversal would return | | Answer: FAEKCDHGB
| | | | | | | | Question: The complexity of Bubble sort algorithm is | | Answer: O(n2)
| | | | | | | | Question: Two dimensional arrays are also called | | Answer: Both Tables and Matrix arrays
| | | | | | | | Question: Linked lists are best suited | | Answer: For the size of the structure and the data in the& nbsp;structure are constantly changing
| | | | | | | | Question: When representing any algebraic expression E which uses only binary operations in a 2-tree, | | Answer: The variable in E will appear as external nodes and&nbs p;operations in internal nodes
| | | | | | | | | | | | |