adplus-dvertising
frame-decoration

Question

What output does the below pseudo code produces?
Tree_node function(Tree_node x)
    {
        Tree_node y = x.left;
        x.left = y.right;
        y.right = x;
        return y;
    }

a.

right rotation of subtree

b.

left rotation of subtree

c.

zig-zag operation

d.

zig-zig operation

Answer: (a).right rotation of subtree

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. What output does the below pseudo code produces?

Similar Questions

Discover Related MCQs

Q. What is the disadvantage of using splay trees?

Q. What is a threaded binary tree traversal?

Q. What are the disadvantages of normal binary tree traversals?

Q. What may be the content of a node in threaded binary tree?

Q. What are null nodes filled with in a threaded binary tree?

Q. The null left pointer pointing to predecessor and null right pointer pointing to successor. how many types of threaded tree are possible with this convention?

Q. What are double and single threaded trees?

Q. In a max-heap, element with the greatest key is always in the which node?

Q. Heap exhibits the property of a binary tree?

Q. What is the complexity of adding an element to the heap.

Q. The worst case complexity of deleting any arbitrary node value element from heap is

Q. Heap can be used as ________________

Q. An array consist of n elements. We want to create a heap using the elements. The time complexity of building a heap will be in order of

Q. What is the space complexity of searching in a heap?

Q. What is the best case complexity in builading a heap?

Q. What is the location of parent node for any arbitary node i?

Q. Given an array of element 5,7,9,1,3,10,8,4. Tick all the correct sequences of elements after inserting all the elements in a min-heap.

Q. Choose the correct properties of weak-heap.

Q. Left child of parent node has value lesser than the parent node.

Q. What is the other name of weak heap?