Implement a maxheap using tree

Feb 13th, 2014
RockCafe
Category:
Calculus
Price: $20 USD

Question 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();

}



Tutor Answer

(Top Tutor) Daniel C.
(997)
School: Boston College
PREMIUM TUTOR

Studypool has helped 1,244,100 students

Summary
Quality
Communication
On Time
Value
BlueOcean
Mar 5th, 2017
" Awesome! Exactly what I wanted. "
Ask your homework questions. Receive quality answers!

Type your question here (or upload an image)

1826 tutors are online

Brown University





1271 Tutors

California Institute of Technology




2131 Tutors

Carnegie Mellon University




982 Tutors

Columbia University





1256 Tutors

Dartmouth University





2113 Tutors

Emory University





2279 Tutors

Harvard University





599 Tutors

Massachusetts Institute of Technology



2319 Tutors

New York University





1645 Tutors

Notre Dam University





1911 Tutors

Oklahoma University





2122 Tutors

Pennsylvania State University





932 Tutors

Princeton University





1211 Tutors

Stanford University





983 Tutors

University of California





1282 Tutors

Oxford University





123 Tutors

Yale University





2325 Tutors