# NPTEL Data Structure And Algorithms Using Java Week 6 Assignment Answers 2023

NPTEL Data Structure And Algorithms Using Java Week 6 Assignment Solutions

## NPTEL Data Structure And Algorithms Using Java Week 6 Assignment Answers 2023

1. Which of the following is FALSE in the case of different types of Binary Trees?
a. A binary tree is a full binary tree, if it contains the maximum possible number of nodes in all levels.
b. A binary tree is said to be a complete binary tree, if all its levels, except possibly the last level, have the maximum number of possible nodes. and all the nodes at the last level appear as far left as possible.
c. A binary tree is said to be a skewed binary tree. if all its levels, all nodes contain only one child.
d. A binary tree is said to be a complete binary tree, if all its levels, except possibly the last level, have the maximum number of possible nodes, and the nodes at the last level may appear anywhere it is possible.

`Answer :- For Answer Click Here`

2.

`Answer :- For Answer Click Here`

3. Choose the Incorrect statement among the given options.
a. In any binary tree, maximum number of nodes on level 1 is 2′, where 1 2 0.
b. Maximum number of nodes possible in a binary tree of height his 2h – 1.
c. Maximum number of nodes possible in a binary tree of height h is 2h + 1.
d. Minimum number of nodes possible in a binary tree of height h is h

`Answer :- For Answer Click Here`

5. What is/are the possible ways of Binary Trees representation?
a. Using only array
b. Using only linked list structure
c. Using either of an Array or Linked list structure
d. Special binary tree data structure is needed: there is no other way

`Answer :- For Answer Click Here`

7.

`Answer :- For Answer Click Here`

7. Which of the following statements is/are FALSE in contest of Binary Search Tree?
a. The nodes which have the same parent are called siblings
b. Minimum number of children that is possible for a node is known as the degree of a node.
c. The node which is at the end and which does not have any child is called leaf node.
d. Root is a specially designated node which has no parent

`Answer :- For Answer Click Here`

8.

`Answer :- For Answer Click Here`

9. Which of the following is False in the case of Binary Search Tree?
a. Inorder traversal on a BST gives the data in ascending order
b. Inorder traversal on a BST gives the data in no particular order
c. the minimum value is at the left-most node
d. the maximum value is at the right-most node

`Answer :- For Answer Click Here`

10. Which of the following is FALSE with respect to complexity of Binary Search Tree?
a. Complexity of Searching in a Binary Search Tree in worst case is O(n)
b. Complexity of Searching in a Binary Search Tree in best case is O(1)
c. Complexity of Searching in a Binary Search Tree in worst case is O(nlog,n)
d Complexity of Searching in a Binary Search Tree in average case id O(log,n)

`Answer :- For Answer Click Here`