Data structure computer

Height of a binary tree is

• MAX( Height of left Subtree, Height of right subtree)+1

• (B) MAX( Height of left Subtree, Height of right subtree)

• MAX( Height of left Subtree, Height of right subtree)-1

• None

MAX( Height of left Subtree, Height of right subtree)+1

• N

• N-1

• N-2

• N*N

The balance factor for an AVL tree is either ---

• -1, 0 or 1

• 0, 1 or 2

• -2, -1 or 0

• All of the above

Which of the following data structure is used to represent hierarchical relationship

between elements.

• Graph

• Linked List

• Tree

• Dequeue

------- search method required input in ascending or descending order

• linear search

• binary search

• DFS

• None of the above

Depth First Search is like a ------ traversal

• Inorder

• Preorder

• Postorder

• Stack

7) In -------- search starts at beginning of list and check every element in the list

• Linear Search

• Binary Search

• Hash Search

• Hash Search

A null graph contains only-----

• Directed node

• Undirected node

• Isolated node

• Adjacent node

Number of edges appearing in sequence of path is called ------

• Cyclic path

• Length of path

• Path

• Indegree

Which type of traversal of binary search tree outputs the value in sorted order?

• Pre-order

• In-order

• Post-order

• None