Hope You Will Get Information as You Wish and Enjoy This Web Story

What is the worst case run-time complexity of binary search algorithm?

GOEDUHUB.COM

1

Ο(n)

If there's no base criteria in a recursive program, the program will

GOEDUHUB.COM

2

Execute Infinitely

The depth of complete binary tree is given by

GOEDUHUB.COM

3

Dn = log2n + 1

The postfix form of the expression (A+ B)*(C*D- E)*F / G is?

GOEDUHUB.COM

4

AB + CD* E – *F *G /

Which data structure is needed to convert infix notation to postfix notation?

GOEDUHUB.COM

5

Stack

One can convert a binary tree to its mirror image by traversing it in

GOEDUHUB.COM

6

Postorder

For an undirected graph with n vertices and e edges, the sum of degree of each vertex is equal to

GOEDUHUB.COM

7

2e

A data structure in which elements can be inserted or deleted at/from both the ends but not in the middle is?

GOEDUHUB.COM

8

Dequeue

What would be the asymptotic time complexity to add a node at the end of singly linked list, if the pointer is initially pointing to the head of the list?