ADS QUIZ FOR MECH1

What is common in three different types of traversals (Inorder, Preorder and Postorder)?

• 
  Root is visited before right subtree

• Root is visited after left subtree

• Left subtree is always visited before right subtree

• All of the above

The inorder and preorder traversal of a binary tree are d b e a f c g and a b d e c f g, respectively. The postorder traversal of the binary tree is:

• d e b f g c a

• e d b g f c a

• e d b f g c a

• 
  d e f g b c a

Choose the equivalent prefix form of the following expression (a + (b − c))* ((d − e)/(f + g − h))

• * +a − bc /− ed + −fgh

  
  

• * +ab − c /− ed + −fgh

• * +a − bc /− de − +fgh

• * +a −bc − /de − +fgh

Which of the following is true about a complete binary tree?

• Every level, except possibly the last, is completely filled

• Every node has either 0 or 2 children

• The height of the tree is always log n, where n is the number of nodes

• All of the above

Which data structure is used for depth-first search?

• Queue

• Stack

• Heap

• Linked List

What is the main difference between binary search tree and AVL tree?

• AVL tree is always balanced, while binary search tree may not be balanced

• Binary search tree is always balanced, while AVL tree may not be balanced

• There is no difference between binary search tree and AVL tree

• AVL tree always has a height of log n, where n is the number of nodes

What is the main difference between red-black tree and AVL tree?

• AVL tree is always balanced, while red-black tree may not be balanced

• Red-black tree is always balanced, while AVL tree may not be balanced

• There is no difference between red-black tree and AVL tree

• Red-black tree always has a height of log n, where n is the number of nodes

Which data structure is used for breadth-first search?

• Queue

• Stack

• Heap

• Linked List

Which traversal method is used to sort an array in non-decreasing order?

• Inorder

• Preorder

• Postorder

• Level order

Which of the following Statement is true for an AVL tree?

P1: The AVL tree must be a B-tree
P2: The AVL tree must be a Binary Search Tree.
P3: The difference between the heights of left and right subtrees for any node cannot be more than one.
P4: The AVL Tree is a self-balancing tree.

• p1 & p4

• p2 & p4

• p2 & p3

• p2,p3 & p4