Question Discussion & Solution

MCQ

In an arbitrary tree ( not a search tree) of order M. Its size is N, and its height is K. The computation time needed to find a data item on T is

O(K*K)

O(M*M)

O(N)

O(K)

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

Why do we impose restrictions like. root property is black. every leaf is black. children of red node are black. all leaves have same black

to get logarithm time complexity

to get linear time complexity

to get exponential time complexity

to get constant time complexity

Discussion

MCQ

What is the time complexity to delete an element from the direct address table?

O(n)

O(logn)

O(nlogn)

O(1)

Discussion

MCQ

A binary tree whose every node has either zero or two children is called

Complete binary tree

Binary search tree

Extended binary tree

None of above

Discussion

MCQ

What are double and single threaded trees?

when both left, right nodes are having null pointers and only right node is null pointer respectively

having 2 and 1 node

using single and double linked lists

using heaps and priority queues

Discussion

MCQ

What is the below pseudo code trying to do, where pt is a node pointer and root pointer.

redblack(Node root, Node pt) :
    if (root == NULL)
       return pt
 
    if (pt.data < root.data)
    {
        root.left  =   redblack(root.left, pt);
        root.left.parent = root
    }
    else if (pt.data > root.data)
    {
        root.right = redblackt(root.right, pt)
        root.right.parent = root
    }
   return root

insert a new node

delete a node

search a node

count the number of nodes

Discussion

Banking

Engineering

General

Medical

Question Discussion & Solution

Report Error

Community Discussion

Similar Questions

Report Error

Report Error

Report Error

Report Error

Report Error

More Data Structure Topics

Data Structure Basics

Abstract data types

Arrays

Lists

Stacks

Queues

Trees

Binary Trees

B Trees

Heaps

Hash based structures

Graphs

Mixed

Banking

Engineering

General

Medical

Question Discussion & Solution

report Report Error

forum Community Discussion

auto_awesome Similar Questions

report Report Error

report Report Error

report Report Error

report Report Error

report Report Error

category More Data Structure Topics

Data Structure Basics

Abstract data types

Arrays

Lists

Stacks

Queues

Trees

Binary Trees

B Trees

Heaps

Hash based structures

Graphs

Mixed

Report Error

Community Discussion

Similar Questions

Report Error

Report Error

Report Error

Report Error

Report Error

More Data Structure Topics