Data Structures 1

Assume there is a tree in which every node has a value greater than value of any node in its LST but lesser

than any node in its RST. An in order traversal of this tree shall result in

• A. a sorted sequence in ascending order

• B. a sorted sequence in descending order

• C. sequence is sorted only of tree is a complete or full binary tree

• D. sequence is not always sorted

Assume an algebric expression E is represented using the binary tree

• A. the variable in E forms external nodes and operators in internal nodes

• B. the operators in E forms external nodes and variables in internal nodes

• C. the variable and operations in E forms internal nodes

• D. the variable and operations in E forms external nodes

Balance factor is defined as the

• A. Difference between Left sub tree and Right sub tree

• B. Difference between the height of Left sub tree and the height of Right sub tree

• C. Difference between Right sub tree and Left sub tree

• D. Difference between the height of Right sub tree and the height of Left sub tree

Assume the level of root node is 1 and the levels of left and right children of root is 2. The maximum number of

nodes on level i of a binary tree is

• A. 2^i

• B. 2^(i-1)

• C. 2^(i+1)

• D. 2^i+1

The maximum number of binary trees that can be formed with three nodes

• A. 3

• B. 1

• C. 5

• D. 4

The height of a binary tree is the maximum number of edges in any root to leaf path. The maximum number of

nodes in a binary tree of height h is:

• A. 2^h-1

• B. 2^(h-1)-1

• C. 2^(h+1)-1

• D. 2*(h+1)

The height of a tree is the length of the longest root-to-leaf path in it. The maximum and minimum number of

nodes in a binary tree of height 4 are

• A. 31 and 5

• B. 32 and 5

• C. 15 and 5

• D. 15 and 4

When the keys like M, S, G, H, B, V, W, T are inserted into Binary Search Tree, the CORRECT option is

• A. W is an internal node

• B. V is a leaf node

• C. S is a root node

• D. B is a leaf node

When the keys like M, S, G, H, B, V, W, T are inserted into Binary Search Tree, the CORRECT option is

• A. Height of tree is 2

• B. Height of tree is 3

• C. Height of tree is 4

• D. Height of tree is 5

When the keys like M, S, G, H, B, V, W, T are inserted into Binary Search Tree, the CORRECT option is

• A. Balance Factor of node S is -2

• B. Balance Factor of node S is +2

• C. Balance Factor of node S is -1

• D. Balance Factor of node S is +1