Question

Q1)

Write a method called inToTree of ExpressionTree class which takes a string of infix expression (fully parenthesized), resets the root of the expression tree to such tree which constructed from the expression. The root set to null of the expression contains characters other than value, operator, and parenthesis or if it’s not an in-fix full parenthesized expression. You may assume each value is single digit only . public void inToTree(String expression){

You may use a JCF Deque class as a stack to keep track of the parenthesis. It may call other helper method like recursive function that takes a string and return a binary tree node, if it calls, you have to write such method.

Q2)

Write a print method of ExpressionTree class which print the expression in fully parenthesized infix. If it calls isLeaf method, then you should finish such method. public void print();

Below is the driver code, the solution needs to be according to it. Thank you!

import java.util.*;
public class A2ExpressionTree{
   public static void main(String argc[]){
      ExprTree et = new ExprTree();
      et.inToTree("(3+(4*5))");
      et.print();
      et.inToTree("(3(4+5)*)");
      et.print();

      Tree t1 = new Tree();
      Tree t2 = new Tree();
      t1.makeTree();
      t1.levelOrder();  //0 1 2 3 4 5 6 13 14 15 7 8 9 10 11 
      t2.makeTree2();
      t2.levelOrder();  //0 1 2 3

   }
}
      
class ExprTree{
   private static class BTNode{
      char value;
      BTNode parent, left, right;
      public BTNode(char e){
        this(e, null, null, null);
      }
      public BTNode(char e, BTNode p, BTNode l, BTNode r){
        value = e;
        parent = p;
        left = l;
        right = r;
      }
   }
   BTNode root;
   public ExprTree(){
      root = null;
   }
   public boolean isEmpty(){
      return root == null;
   }
   public void inToTree(String expression){
   }
//inToTree may call-   public BTNode parseInToTree(String expression)
   

//   public boolean isLeaf(BTNode n){ 
   public void print(){
   }

}
class Tree{
   private static class TNode{
      private int value;
      private TNode parent;
      private List<TNode> children;
      public TNode(){
         this(0, null);
      }
      public TNode(int e){
         this(e, null);
      }
      public TNode(int e, TNode p){
         value = e;
         parent = p;
         children = new ArrayList<TNode>();
      }
   }
   private TNode root;
   private int size;
   Tree(){
      root = null;
      size = 0;
   }
    public TNode createNode(int e, TNode p){
       return new TNode(e, p);
    }
    public TNode addChild(TNode n, int e){
       TNode temp = createNode(e, n);
       n.children.add(temp);
       size++;
       return temp;
    }
    public void makeTree(){
       root = createNode(0, null);
       size++;
       buildTree(root, 3);
    }
    public void makeTree2(){
       root = createNode(0, null); 
       size++; 
       buildTree(root, 1);
    }
    private void buildTree(TNode n, int i){
       if (i <= 0) return;
       TNode fc = addChild(n, size);
       TNode sc = addChild(n, size);
       TNode tc = addChild(n, size);
       buildTree(fc, i - 1);
       buildTree(sc, i - 2);
       if (i % 2 == 0)
          buildTree(tc, i - 1);
   }
}

Answer 1

Public static Totree (Node node)

{

If(node==null)

Return null;

Node lnode= node.left ;

Node rnode= node.right

Return node;

}