/* * Returns true if this tree and that tree "look the same." (i.e. They have the * same keys in the same locations in the tree.) Note that just having the same * keys is NOT enough. They must also be in the same positions in the tree. */ public boolean treeEquals(IntTree that) { // TODO throw new RuntimeException("Not implemented"); } • You are not allowed to use any kind of loop in your solutions. • You may not modify the Node class in any way • You may not modify the function headers of any of the functions already present in the file. • You may not add any fields to the IntTree class.
import java.util.LinkedList;
public class IntTree {
private Node root;
private static class Node {
public int key;
public Node left, right;
public Node(int key) {
this.key = key;
}
}
public void printInOrder() {
printInOrder(root);
}
private void printInOrder(Node n) {
if (n == null)
return;
printInOrder(n.left);
System.out.println(n.key);
printInOrder(n.right);
}
/*
* Returns true if this tree and that tree "look the same." (i.e. They have the
* same keys in the same locations in the tree.) Note that just having the same
* keys is NOT enough. They must also be in the same positions in the tree.
*/
public boolean treeEquals(IntTree that) {
// TODO
throw new RuntimeException("Not implemented");
}
• You are not allowed to use any kind of loop in your solutions.
• You may not modify the Node class in any way
• You may not modify the function headers of any of the functions already present in the file.
• You may not add any fields to the IntTree class.
Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 1 images
