Can you please help me with this assignment by 11:30 pm CDT tonight

Question

Ayush · Accepted Answer

srcForStudents/.BinaryTree.java.swp
srcForStudents/.DS_Store
srcForStudents/.gradle/4.4.1/fileChanges/last-build.bin
srcForStudents/.gradle/4.4.1/fileHashes/fileHashes.lock
srcForStudents/.gradle/4.4.1/taskHistory/taskHistory.bin
srcForStudents/.gradle/4.4.1/taskHistory/taskHistory.lock
srcForStudents/.gradle/buildOutputCleanup/buildOutputCleanup.lock
srcForStudents/.gradle/buildOutputCleanup/cache.properties
#Sun Oct 13 13:45:14 CDT 2019
gradle.version=4.4.1
srcForStudents/.TestBinaryTree.java.swp
srcForStudents/BinarySearchTree.java
srcForStudents/BinaryTree$BinaryNode.class
synchronized class BinaryTree$BinaryNode {
    private Object data;
    private BinaryTree$BinaryNode leftNode;
    private BinaryTree$BinaryNode rightNode;
    public void BinaryTree$BinaryNode(BinaryTree, Object);
    public String toString();
    public BinaryTree$BinaryNode getLeftNode();
    public BinaryTree$BinaryNode getRightNode();
    public void setLeftNode(BinaryTree$BinaryNode);
    public void setRightNode(BinaryTree$BinaryNode);
    public Object getData();
    public void setData(Object);
    public int height();
    public boolean isLeaf();
    public String preOrderTraverse();
    public String postOrderTraverse();
    public String inOrderTraverse();
}
srcForStudents/BinaryTree$Queue.class
synchronized class BinaryTree$Queue {
    private Object key;
    BinaryTree$Queue next;
    BinaryTree$Queue front;
    BinaryTree$Queue rear;
    public void BinaryTree$Queue(BinaryTree);
    void enqueue(Object);
    Object dequeue();
    int size();
}
srcForStudents/BinaryTree.class
public synchronized class BinaryTree {
    BinaryTree$BinaryNode root;
    private Object nullSymbol;
    public void BinaryTree();
    public void BinaryTree(Object[]);
    public void BinaryTree(Object[], Object);
    private void initFromBfsSequence(Object[]);
    private void handelNullParentNode(java.util.List, int, int);
    private void handleNonNullParentNode(java.util.List, int, Object[]);
    public void remove(int);
    public int height();
    public int width();
    public String breadthFirstTraverse();
    public String preOrderTraverse();
    public String postOrderTraverse();
    public String inOrderTraverse();
}
srcForStudents/BinaryTree.java
srcForStudents/BinaryTree.java
import java.util.List;
import java.util.ArrayList;
public class BinaryTree{
    BinaryNode root = null;  
    
    private T nullSymbol = null;
    /**
     * Default constructor
     */
    public BinaryTree(){
    }
    /**
     *  This constructor is useful for test purposes,
     *  not meant for use in general.
     *
     *  Constructs a binary tree from a given valid breadth-first traversal sequence.
     *  @param seq is an array containing breadth-first traversal sequence of the nodes of a tree.
     */
    public BinaryTree(T[] seq){
        initFromBfsSequence(seq);
    }
    /**
     *  This constructor is useful for test purposes,
     *  not meant for use in general.
     *
     *  Constructs a binary tree from a given valid breadth-first traversal sequence. 
     *  A given special symbol (nullSymbol) in the sequence is interpreted as absence of node. 
     *  During construction of the tree, when such a special symbol is encountered, 
     *  that is considered to be an absent node, and thus no corresponding node is added to the tree.
     *  
     *  @param seq is an array containing breadth-first traversal sequence of the nodes of a tree.
     *  @param nullSymbol is a special symbol in the given sequence that denotes absence of a node.
     */
    public BinaryTree(T[] seq, T nullSymbol){
        this.nullSymbol = nullSymbol;
        initFromBfsSequence(seq);
    }
    private void initFromBfsSequence(T[] seq){
        if(seq.length == 0)
            throw new IllegalArgumentException("Cannot build tree from empty sequence");
        
        if(seq[0].equals(nullSymbol))
            throw new IllegalArgumentException("Symbol for root cannot be nullSymbol");
                
        List> nodes = new ArrayList>(seq.length);
        this.root = new BinaryNode(seq[0]);
        nodes.add(root);
        for(int i = 0; i > nodes, 
                        int nullNodeIndex, int seqLength){
        int leftIndex = (nullNodeIndex * 2) + 1; // finding the left child index from formula 
                
        if(leftIndex > nodes, 
                                int parentIndex, T[] seq){
        int leftIndex = (parentIndex * 2) + 1;          
        if(leftIndex  leftNode = null;
            if(!seq[leftIndex].equals(nullSymbol)){
                leftNode = new BinaryNode(seq[leftIndex]);
            }
            nodes.get(parentIndex).leftNode = leftNode;
            nodes.add(leftNode);
            int rightIndex = (parentIndex * 2) + 2;             
            if(rightIndex  rightNode = null;
                if(!seq[rightIndex].equals(nullSymbol)){
                    rightNode = new BinaryNode(seq[rightIndex]);
                }
                nodes.get(parentIndex).rightNode = rightNode;
                nodes.add(rightNode);           
            }
        }
    }
    
    public int height(){
        if (root == null) return 0; 
        return root.height();
    }
    public int width(){
        if (root == null) return 0; 
        int w =0;
        Queue Q = new Queue();
        Q.enqueue(root);
        while( Q.rear != null && Q.front!=null){
            int cnt = Q.size();
            w = w>cnt?w:cnt;
            while (cnt-- > 0) {
                BinaryNode temp = Q.dequeue();
                if(temp != null){
                    if (temp.leftNode != null)
                    {
                        Q.enqueue(temp.leftNode);
                    }
                    if (temp.rightNode != null)
                    {
                        Q.enqueue(temp.rightNode);

Can you please help me with this assignment by 11:30 pm CDT tonight

Answer To: Can you please help me with this assignment by 11:30 pm CDT tonight

Answer To This Question Is Available To Download

Related Questions & Answers

Submit New Assignment