### Question:
BinaryHashTree { public int get(int key) { System.out.println(root.key); if (key == root.key) { return root.val; } return find(root, key); }  Node set(int key, int val); int get(int key);  }### Answer:
@Test public void getTest(){ Assertions.assertEquals(bht.get(5),5); Assertions.assertEquals(bht.get(7),3); }