Tuesday
March 28, 2017

Post a New Question

Posted by on .

Can someone please make a Binarytree of these methodes in Java?:
public void add(int element)
//Adds the specified element into this datastructure.

public void clear()
//Removes all of the elements from this datastructure.

public boolean contains(int element)
//Tests if the specified element is a component in this datastructure.

public int[] inOrder()
//Returns an array containing all of the elements in this datastructure inorder.

public int[] postOrder()
Returns an array containing all of the elements in this datastructure postorder.

public int[] preOrder()
Returns an array containing all of the elements in this datastructure preorder.

public void remove(int element)
Removes the specified element from this datastructure.

public int size()
Returns the number of components in this datastructure.

public int[] toArray()
Returns an array containing all of the elements in this datastructure inorder.

String toString()
Returns a string representation of this datastructure, containing the String representation of each element inorder

  • Computer Programming? - ,

    If you really want an expert to help you, be sure to follow directions and type your subject in the School Subject box. Any other words, including obscure abbreviations, are likely to delay responses from a teacher who knows that subject well.

Answer This Question

First Name:
School Subject:
Answer:

Related Questions

More Related Questions

Post a New Question