checkSum(struct bin-treenode *root , int sum) :
if(root==null)
return sum as 0
else :
leftover_sum=sum-root_node-->value
//missinga)
public void preOrder(Tree root)
{
if (root == null) return;
Stack stk = new Stack();
st.add(root);
while (!stk.empty())
{
Tree node = stk.pop();
System.out.print(node.data + " ");
if (node.left != null) stk.push(node.left);
if (node.right != null) stk.push(node.right);
}
}
b)
public void preOrder(Tree root)
{
if (root == null) return;
Stack stk = new Stack();
while (!stk.empty())
{
Tree node = stk.pop();
System.out.print(node.data + " ");
if (node.right != null) stk.push(node.right);
if (node.left != null) stk.push(node.left);
}
}
c)
public void preOrder(Tree root)
{
if (root == null) return;
Stack stk = new Stack();
st.add(root);
while (!stk.empty())
{
Tree node = stk.pop();
System.out.print(node.data + " ");
if (node.right != null) stk.push(node.right);
if (node.left != null) stk.push(node.left);
}
}
d) None of the mentioned 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