Question
a)
public void min(Tree root)
{
while(root.left() != null)
{
root = root.left();
}
System.out.println(root.data());
}
b)
public void min(Tree root)
{
while(root != null)
{
root = root.left();
}
System.out.println(root.data());
}
c)
public void min(Tree root)
{
while(root.right() != null)
{
root = root.right();
}
System.out.println(root.data());
}
d)
public void min(Tree root)
{
while(root != null)
{
root = root.right();
}
System.out.println(root.data());
}a.
a
b.
b
c.
c
d.
d
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. How will you find the minimum element in a binary search tree?
Similar Questions
Discover Related MCQs
Q. What are the worst case and average case complexities of a binary search tree?
View solution
Q. What are the conditions for an optimal binary search tree and what is its advantage?
View solution
Q. What is an AVL tree?
View solution
Q. Why we need to a binary tree which is height balanced?
View solution
Q. What is the maximum height of an AVL tree with p nodes?
View solution
Q. To restore the AVL property after inserting a element, we start at the insertion point and move towards root of that tree. is this statement true?
View solution
Q. Given an empty AVL tree, how would you construct AVL tree when a set of numbers are given without performing any rotations?
View solution
Q. What maximum difference in heights between the leafs of a AVL tree is possible?
View solution
Q. Why to prefer red-black trees over AVL trees?
View solution
Q. What is a Cartesian tree?
View solution
Q. Which of the below statements are true:
i.Cartesian tree is not a height balanced tree
ii.Cartesian tree of a sequence of unique numbers can be unique generated
View solution
Q. What is the speciality of cartesian sorting?
View solution
Q. Consider a sequence of numbers to have repetitions, how a cartesian tree can be constructed in such situations without violating any rules?
View solution
Q. After applying the below operations on a input sequence, what happens?
i. construct a cartesian tree for input sequence
ii. put the root element of above tree in a priority queue
iii. if( priority queue is not empty) then
.search and delete minimum value in priority queue
.add that to output
.add cartesian tree children of above node to priority queue
View solution
Q. Cartesian trees are most suitable for?
View solution
Q. A treap is a cartesian tree with
View solution
Q. Cartesian trees solve range minimum query problem in constant time
View solution
Q. Consider below sequences:
array=60 90 10 100 40 150 90
reverse 2 to 3
array=60 10 90 100 40 150 90
reverse 3 to 6
array= 60 100 150 40 100 90 90
now printout from 1 to 6 :-- 60 100 150 40 100 90
How to achieve the above operation efficiently?
View solution
Q. What is a weight balanced tree?
View solution
Q. What are the applications of weight balanced 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!
