What is the below pseudo code trying to do, where pt is a no...

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

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

Why Red-black trees are preferred over hash tables though hash tables have constant time complexity?

no they are not preferred

because of resizing issues of hash table and better ordering in redblack trees

because they can be implemented using trees

because they are balanced

Discussion

MCQ

What is the disadvantage of using splay trees?

height of a splay tree can be linear when accessing elements in non decreasing order.

splay operations are difficult

no significant disadvantage

splay tree performs unnecessary splay when a node is only being read

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

Why the below pseudo code where x is a value, wt is weight factor and t is root node can

when x>t. element Rotate-with-left-child should take place and vice versa

the logic is incorrect

the condition for rotating children is wrong

insertion cannot be performed in weight balanced trees

Discussion

MCQ

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

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

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

code for having recursive calls to either only left tree

code for having recursive calls to either only right trees

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