1/21/25, 1:50 PM Assignment-2 (Tree)

Assignment-2 (Tree)

1. Email *

2. Suppose a binary tree is constructed with n nodes, such that each node has 1 point
exactly either zero or two children. The maximum height of the tree will be?

Mark only one oval.

(n+1)/2

(n-1)/2

n/2 -1

(n+1)/2 -1

3. Degree of a leaf node is____ 1 point

Mark only one oval.

4. The depth of root node is 1 point

Mark only one oval.

[Link] 1/14
1/21/25, 1:50 PM Assignment-2 (Tree)

5. A binary tree of height h has at least h nodes and at most ____ nodes 1 point

Mark only one oval.

2h

2^h

2^(h+1)

2^h - 1

6. Pre-order traversal is also called______ 1 point

Mark only one oval.

Depth first

Breadth first

Level order

In-order

7. Total number of nodes at the nth level of a binary tree can be given as 1 point

Mark only one oval.

2^n

2^(n+1)

2^(n-1)

None of these

[Link] 2/14
1/21/25, 1:50 PM Assignment-2 (Tree)

8. Where 7 will be inserted in following binary search tree? 1 point

Mark only one oval.

Option 1 Option 2

[Link] 3/14
1/21/25, 1:50 PM Assignment-2 (Tree)

Option 3 None of them

9. A B-tree of order 2 and of height 3 will have a maximum _____ keys. 1 point

Mark only one oval.

15

16

None of above

10. A root node of binary tree may have maximum____ children 1 point

Mark only one oval.

[Link] 4/14
1/21/25, 1:50 PM Assignment-2 (Tree)

11. A node with zero child node in a tree is called _____ 1 point

Mark only one oval.

Leaf Node

Root Node

Parent Node

Index Node

12. In a Red-Black tree, the root node will be of ___ color 1 point

Mark only one oval.

Red

Black

Any of above

None of above

13. In a B-Tree of order 5, maximum key values that can be stored in a node 1 point
are______

Mark only one oval.

None of above

[Link] 5/14
1/21/25, 1:50 PM Assignment-2 (Tree)

14. Consider an empty B-Tree in which we have to insert 3, 15, 8, 2, 9, 6, 12, 1 point
18, 14, 7, 24, 14, 21, 27, 5, 17, 19, 25, 26, 20. The third split will take place
when we insert____

Mark only one oval.

21

14

27

15. The intermediate nodes in B+ tree may store 1 point

Mark only one oval.

Key Values

Index Values

Both

None of above

16. Which of the following is true? 1 point

Mark only one oval.

larger the order of B-tree, less frequently the split occurs

larger the order of B-tree, more frequently the split occurs

smaller the order of B-tree, more frequently the split occurs

smaller the order of B-tree, less frequently the split occurs

17. In a B+ tree 1 point

Mark only one oval.

only rapid random access is allowed

only rapid sequential is allowed

rapid random access as well as rapid sequential access allowed

None of above

[Link] 6/14
1/21/25, 1:50 PM Assignment-2 (Tree)

18. A B+ tree can contain a maximum of 9 pointers in a node. what is the 1 point
minimum number of keys in leaves?

Mark only one oval.

19. Consider two statements for B+ tree: (1) When a node is split during 1 point

insertion, the middle key value is promoted to the parent as well as retained
in right half-node; (2) When a key is deleted from the leaf, it is also deleted
from the index nodes of the tree

Mark only one oval.

only statement (1) is true

only statement (2) is true

Both statements are true

Both statements are false

20. What is the maximum number of keys that a B+ tree of order 4 and height 3 1 point

Mark only one oval.

64

63

65

81

[Link] 7/14
1/21/25, 1:50 PM Assignment-2 (Tree)

21. The _________ order traversal in Binary Search Tree traverse in an 1 point

increasing order

Mark only one oval.

in

pre

post

All of above

22. A B+ -tree of order 3 is generated by inserting 95, 11 and 5. The generated B+ 1 point

-tree is

Mark only one oval.

Option 1 Option 2

Option 3 None of above

[Link] 8/14
1/21/25, 1:50 PM Assignment-2 (Tree)

23. Consider the attached Binary Search Tree. What will be the root node after 1 point

deleting the 14

Mark only one oval.

11

None of above

24. Which of the following is a true about Binary Trees? 1 point

Mark only one oval.

Every binary tree is either complete or full.

Every complete binary tree is also a full binary tree.

Every full binary tree is also a complete binary tree.

No binary tree is both complete and full.

None of the above

[Link] 9/14
1/21/25, 1:50 PM Assignment-2 (Tree)

25. Suppose we have numbers between 1 and 1000 in a binary search tree and 1 point

want to search for the number 363. Which of the following sequence could
not be the sequence of the node examined?

Mark only one oval.

2, 252, 401, 398, 330, 344, 397, 363

924, 220, 911, 244, 898, 258, 362, 363

925, 202, 911, 240, 912, 245, 258, 363

2, 399, 387, 219, 266, 382, 381, 278, 363

26. In full binary search tree every internal node has exactly two children. If 1 point

there are 100 leaf nodes in the tree, how many internal nodes are there in
the tree?

Mark only one oval.

25

49

99

101

27. Which type of traversal of binary search tree outputs the value in sorted 1 point

order?

Mark only one oval.

Pre-order

In-order

Post-order

None

[Link] 10/14
1/21/25, 1:50 PM Assignment-2 (Tree)

28. A binary search tree is generated by inserting in order the following 1 point

integers:50, 15, 62, 5, 20, 58, 91, 3, 8, 37, 60, 24. The number of the node
in the left sub-tree and right sub-tree of the root, respectively, is

Mark only one oval.

(4, 7)

(7, 4)

(8, 3)

(3, 8)

29. What is a full binary tree? 1 point

Mark only one oval.

Each node has exactly zero or two children

Each node has exactly two children

All the leaves are at the same level

Each node has exactly one or two children

30. What is a complete binary tree? 1 point

Mark only one oval.

Each node has exactly zero or two children

A binary tree, which is completely filled, with the possible exception of the bottom
level, which is filled from right to left

A binary tree, which is completely filled, with the possible exception of the bottom
level, which is filled from left to right

A tree In which all nodes have degree 2

[Link] 11/14
1/21/25, 1:50 PM Assignment-2 (Tree)

31. Which of the following is false about a binary search tree? 1 point

Mark only one oval.

The left child is always lesser than its parent

The right child is always greater than its parent

The left and right sub-trees should also be binary search trees

In order sequence gives decreasing order of elements

32. In delete operation of BST, we need inorder successor (or predecessor) of a 1 point

node when the node to be deleted has both left and right child as non-
empty. Which of the following is true about inorder successor needed in
delete operation?

Mark only one oval.

Inorder Successor is always a leaf node

Inorder successor is always either a leaf node or a node with empty left child

Inorder successor may be an ancestor of the node

Inorder successor is always either a leaf node or a node with empty right child

33. How many distinct binary search trees can be created out of 4 distinct keys? 1 point

Mark only one oval.

14

24

42

[Link] 12/14
1/21/25, 1:50 PM Assignment-2 (Tree)

34. Suppose the numbers 7, 5, 1, 8, 3, 6, 0, 9, 4, 2 are inserted in that order into 1 point

an initially empty binary search tree. The binary search tree uses the usual
ordering on natural numbers. What is the in-order traversal sequence of the
resultant tree?

Mark only one oval.

7510324689

0243165987

0123456789

9864230157

35. The following numbers are inserted into an empty binary search tree in the 1 point

given order: 10, 1, 3, 5, 15, 12, 16. What is the height of the binary search
tree (the height is the maximum distance of a leaf node from the root)?

Mark only one oval.

36. While inserting the elements 71, 65, 84, 69, 67, 83 in an empty binary 1 point

search tree (BST) in the sequence shown, the element in the lowest level is

Mark only one oval.

65

67

69

83

This content is neither created nor endorsed by Google.

Forms
[Link] 13/14
1/21/25, 1:50 PM Assignment-2 (Tree)

[Link] 14/14