Implement a maxheap using tree

User Generated

grerebw

Programming

Description

  The file must be called HeapTree.java, have a no-arg constructor, and implement

SimpleHeap interface. HeapTree.java should have methods insert, deleteMax, and

preOrderTraversal with signature lines that match the interface. HeapTree.java will use nodes to

build a binary tree to create a heap of Strings.

Your next file should be called something like Node.java and will contain a String data, a

Node left, a Node right, and probably a Node parent (optional). Basic simple coding in JAVA



public interface SimpleHeap {

public void insert(String str);

public String deleteMax();

public String preOrderTraversal();

}



User generated content is uploaded by users for the purposes of learning and should be used following Studypool's honor code & terms of service.

This question has not been answered.

Create a free account to get help with this and any other question!

Similar Content

Related Tags