(int d)
| 30 | } |
| 31 | |
| 32 | public void insertInOrder(int d) { |
| 33 | if (d <= data) { |
| 34 | if (left == null) { |
| 35 | setLeftChild(new TreeNode(d)); |
| 36 | } else { |
| 37 | left.insertInOrder(d); |
| 38 | } |
| 39 | } else { |
| 40 | if (right == null) { |
| 41 | setRightChild(new TreeNode(d)); |
| 42 | } else { |
| 43 | right.insertInOrder(d); |
| 44 | } |
| 45 | } |
| 46 | size++; |
| 47 | } |
| 48 | |
| 49 | public int size() { |
| 50 | return size; |
no test coverage detected