Data Structures

In preorder traversal of a binary tree the second step is ____________

• traverse the right subtree

• traverse the left subtree

• traverse right subtree and visit the root

• visit the root

How many leaf are there in the tree?

• 1

• 3

• 4

• 7

A Data Structure is:

• A C++ vector

• A way of organizing, storing and performing operations on data.

• A function in any programming language

• A sequence of steps to solve a problem.

Given a sequence of number below:

50,60,40,70,45,55,30,80,65,35,25,75,85

When creating a binary search tree, what is the height of the tree?

• 3

• 4

• 5

• 6

Given a binary search tree, insert 27, 15, 63, 99, 70 and 85 (in this order) into the binary search tree. What is the post-order traversal?

• 5,15,27,34,47,54,63,70,72,75,83,85,88,94,99,101

• 72,54,34,5,27,15,47,63,70,83,75,88,85,101,94,99

• 15,27,5,47,34,70,63,54,75,85,99,94,101,88,83,72

• 15,27,5,47,34,63,54,70,75,85,99,94,101,88,83,72

• none of the above

Choose the correct statement

• A data structure is a specialised format for organising and storing data

• A data structure is a specialised format for organising and storing information

• A data structure is a format for organising and storing only one data type

• A data structure is too complicated to truly understand or use

If the elements “A”, “B”, “C” and “D” are placed in a queue and are deleted one at a time, in what order will they be removed?

• a) ABCD

• b) DCBA

• c) DCAB

• d) ABDC

Storage for data defined in terms of set of operations to be performed on the data 

• Arrays
• Variables
• Abstract Data Types
• Algorithms

If the insertion and deletion happens from both the ends then the queue is called a______Queue

• a) Deque

• b) Header

• c) Queue

• d) Circular Queue

What is the value of the postfix expression 6 3 2 4 + – *:

• 1

• 14

• 74

• -18