Question Discussion & Solution

a)

public void inorder(Tree root)
{
 System.out.println(root.data);
 inorder(root.left);
 inorder(root.right);
}

b)

public void inorder(Tree root)
{
 inorder(root.left);
 System.out.println(root.data);
 inorder(root.right);
}

c)

public void inorder(Tree root)
{
 System.out.println(root.data);
 inorder(root.right);
 inorder(root.left);
}

d) None of the mentioned

avltree leftrotation(avltreenode z):
   avltreenode w =x-left
   x-left=w-right
   w-right=x
   x-height=max(Height(x-left),Height(x-right))+1 
   w-height=max(missing)+1   
  return w