Hello I need some help getting started or post a needed solution for this questi

Question

Hello

I need some help getting started or post a needed solution for this question

Write an array-based implementation of the ADT Binary Search Tree that uses dynamic memory allocation. Use the ArrayList class in the java.util package to represent the Binary Search Tree as shown in Figure 11-11

----------------

I have the chegg solution ebook however it is missing. I am looking for the solutions for

Chapter 11, 1PP

Data-abstraction-and-problem-solving-with-java-walls-and-mirrors-3rd-edition-solutions-

ISBN-9780132122306

thanks

Explanation / Answer

package ch08.trees;

public interface BSTInterface{// Used to specify traversal order

public static final int INORDER = 1;public static final int PREORDER = 2;

public static final int POSTORDER = 3;

public boolean isEmpty();// Effect: Determines whether this BST is empty// Postcondition: Return value = (this BST is empty)

public boolean isFull();// Effect: Determines whether this BST is full// Postcondition: Return value = (this BST is full)

public int numberOfNodes();// Effect: Determines the number of nodes in this BST// Postcondition: Return value = number of nodes in this BST

public Comparable isThere(Comparableitem);

// Effect: Determines whether element matching item is in this BST// Postcondition: Return value = (element with the same key as item is in// this BST)

public Comparable retrieve(Comparable item);

public void insert (Comparable item);

public void delete (Comparable item);

public int reset(int orderType);

public Comparable getNextItem (int orderType);

}

Related Questions

Navigate

• Browse (All)
• Browse H
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.