Binary Search Trees(B Tree) MCQ question and answer with solution

Section 1 Section 2 Section 3

41.
How many orders of traversal are applicable to a binary tree (In General)?

A. 1

B. 4

C. 2

D. 3

Answer & Solution Discuss in Board Save for Later

42.
Which of the following properties are obeyed by all three tree - traversals?

A. Left subtrees are visited before right subtrees

B. Right subtrees are visited before left subtrees

C. Root node is visited before left subtree

D. Root node is visited before right subtree

Answer & Solution Discuss in Board Save for Later

43.
Level order traversal of a tree is formed with the help of

A. breadth first search

B. depth first search

C. dijkstra's algorithm

D. prims algorithm

Answer & Solution Discuss in Board Save for Later

44.
Which type of data structure does rope represent?

A. Array

B. Linked List

C. Queue

D. Binary Tree

Answer & Solution Discuss in Board Save for Later

45.
What is inefficient with the below threaded binary tree picture?

A. it has dangling pointers

B. nothing inefficient

C. incorrect threaded tree

D. space is being used more

Answer & Solution Discuss in Board Save for Later

46.
Two balanced binary trees are given with m and n elements respectively. They can be merged into a balanced binary search tree in . . . . . . . . time.

A. O(m+n)

B. O(mn)

C. O(m)

D. O(mlog n)

Answer & Solution Discuss in Board Save for Later

47.

What is missing in this logic of finding a path in the tree for a given sum (i.e checking whether there will be a path from roots to leaf nodes with given sum)?

checkSum(struct bin-treenode *root , int sum) :
  if(root==null)
    return sum as 0
  else :
     leftover_sum=sum-root_node-->value
     //missing

A. code for having recursive calls to either only left tree or right trees or to both subtrees depending on their existence

B. code for having recursive calls to either only left tree or right trees

C. code for having recursive calls to either only left tree

D. code for having recursive calls to either only right trees

Answer & Solution Discuss in Board Save for Later

48.
Which of the below statements are true?
i. Cartesian tree is not a height balanced tree
ii. Cartesian tree of a sequence of unique numbers can be unique generated

A. both statements are true

B. only i. is true

C. only ii. is true

D. both are false

Answer & Solution Discuss in Board Save for Later

49.
Which of the following pair's traversals on a binary tree can build the tree uniquely?

A. post-order and pre-order

B. post-order and in-order

C. post-order and level order

D. level order and preorder

Answer & Solution Discuss in Board Save for Later

50.
What is the time complexity for the update cost on auxiliary trees?

A. O (log (log n))

B. k-1 O (log n)

C. K² O (log n)

D. k+1 O (log (log n))

Answer & Solution Discuss in Board Save for Later

1 2 3 4 5 6 7 8

41.
How many orders of traversal are applicable to a binary tree (In General)?

Answer & Solution

42.
Which of the following properties are obeyed by all three tree - traversals?

Answer & Solution

43.
Level order traversal of a tree is formed with the help of

Answer & Solution

44.
Which type of data structure does rope represent?

Answer & Solution

45.
What is inefficient with the below threaded binary tree picture?

Answer & Solution

46.
Two balanced binary trees are given with m and n elements respectively. They can be merged into a balanced binary search tree in . . . . . . . . time.

Answer & Solution

47.
What is missing in this logic of finding a path in the tree for a given sum (i.e checking whether there will be a path from roots to leaf nodes with given sum)?

`checkSum(struct bin-treenode *root , int sum) : if(root==null) return sum as 0 else : leftover_sum=sum-root_node-->value //missing`

Answer & Solution

48.
Which of the below statements are true?
i. Cartesian tree is not a height balanced tree
ii. Cartesian tree of a sequence of unique numbers can be unique generated

Answer & Solution

49.
Which of the following pair's traversals on a binary tree can build the tree uniquely?

Answer & Solution

50.
What is the time complexity for the update cost on auxiliary trees?

Answer & Solution

Read More Section(Binary Search Trees(B Tree))

Binary Search Trees(B Tree) MCQ question and answer with solution | Data Structure MCQs

41. How many orders of traversal are applicable to a binary tree (In General)?

Answer & Solution

42. Which of the following properties are obeyed by all three tree - traversals?

Answer & Solution

43. Level order traversal of a tree is formed with the help of

Answer & Solution

44. Which type of data structure does rope represent?

Answer & Solution

45. What is inefficient with the below threaded binary tree picture?

Answer & Solution

46. Two balanced binary trees are given with m and n elements respectively. They can be merged into a balanced binary search tree in . . . . . . . . time.

Answer & Solution

47. What is missing in this logic of finding a path in the tree for a given sum (i.e checking whether there will be a path from roots to leaf nodes with given sum)? checkSum(struct bin-treenode *root , int sum) : if(root==null) return sum as 0 else : leftover_sum=sum-root_node-->value //missing

Answer & Solution

48. Which of the below statements are true? i. Cartesian tree is not a height balanced tree ii. Cartesian tree of a sequence of unique numbers can be unique generated

Answer & Solution

49. Which of the following pair's traversals on a binary tree can build the tree uniquely?

Answer & Solution

50. What is the time complexity for the update cost on auxiliary trees?

Answer & Solution

Read More Section(Binary Search Trees(B Tree))

41.
How many orders of traversal are applicable to a binary tree (In General)?

42.
Which of the following properties are obeyed by all three tree - traversals?

43.
Level order traversal of a tree is formed with the help of

44.
Which type of data structure does rope represent?

45.
What is inefficient with the below threaded binary tree picture?

46.
Two balanced binary trees are given with m and n elements respectively. They can be merged into a balanced binary search tree in . . . . . . . . time.

47.
What is missing in this logic of finding a path in the tree for a given sum (i.e checking whether there will be a path from roots to leaf nodes with given sum)?

`checkSum(struct bin-treenode *root , int sum) : if(root==null) return sum as 0 else : leftover_sum=sum-root_node-->value //missing`

48.
Which of the below statements are true?
i. Cartesian tree is not a height balanced tree
ii. Cartesian tree of a sequence of unique numbers can be unique generated

49.
Which of the following pair's traversals on a binary tree can build the tree uniquely?

50.
What is the time complexity for the update cost on auxiliary trees?