Question
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 roota.
insert a new node
b.
delete a node
c.
search a node
d.
count the number of nodes
Posted under Data Structures and Algorithms
Engage with the Community - Add Your Comment
Confused About the Answer? Ask for Details Here.
Know the Explanation? Add it Here.
Q. What is the below pseudo code trying to do, where pt is a node pointer and root pointer.
Similar Questions
Discover Related MCQs
Q. After the insertion operation, is the resultant tree a splay tee?
View solution
Q. What is inefficient with the below threaded binary tree picture?
View solution
Q. If we implement heap as min-heap , deleting root node (value 1)from the heap. What would be the value of root node after second iteration if leaf node (value 100) is chosen to replace the root at start.
View solution
Q. If we implement heap as maximum heap , adding a new node of value 15 to the left most node of right subtree . What value will be at leaf nodes of the right subtree of the heap.
View solution
Q. Binary trees can have how many children?
View solution
Q. Disadvantage of using array representation for binary trees is?
View solution
Q. What must be the ideal size of array if the height of tree is ‘l’?
View solution
Q. What are the children for node ‘w’ of a complete-binary tree in an array representation?
View solution
Q. What is the parent for a node ‘w’ of a complete binary tree in an array representation when w is not 0?
View solution
Q. If the tree is not a complete binary tree then what changes can be made for easy access of children of a node in the array ?
View solution
Q. Consider a situation of writing a binary tree into a file with memory storage efficiency in mind, is array representation of tree is good?
View solution
Q. Why is heap implemented using array representations than tree(linked list) representations though both tree representations and heaps have same complexities?
for binary heap
-insert: O(log n)
-delete min: O(log n)
for a tree
-insert: O(log n)
-delete: O(log n)
Then why go with array representation when both are having same values ?
View solution
Q. Can a tree stored in an array using either one of inorder or post order or pre order traversals be again reformed?
View solution
Q. Advantages of linked list representation of binary trees over arrays?
View solution
Q. Disadvantages of linked list representation of binary trees over arrays?
View solution
Q. How to travel a tree in linkedlist representation?
View solution
Q. Level order traversal of a tree is formed with the help of
View solution
Q. Why we prefer threaded binary trees?
View solution
Q. The following lines talks about deleting a node in a binary tree.(the tree property must not be violated after deletion)
i) from root search for the node to be deleted
ii)
iii) delete the node at
what must be statement ii) and fill up statement iii)
View solution
Q. What may be the psuedo code for finding the size of a tree?
View solution
Suggested Topics
Are you eager to expand your knowledge beyond Data Structures and Algorithms? We've curated a selection of related categories that you might find intriguing.
Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!
.png)
