@@ -0,0 +1,670 @@
+package comp2402a5;%0A%0A%0A/**%0A * An implementation of binary trees based on the%0A * Node class from the ODS library (by P. Morin)%0A */%0Apublic class Node %7B%0A%09public Node parent;     // parent node%0A %09public Node left;       // left child%0A%09public Node right;      // right child%0A%0A%09public Integer data;    // data value stored in node%0A%0A%09public int postorderN;  // postorder number for this node%0A%09public int preorderN;   // preorder number for this node%0A%09public int inorderN;    // inorder number for this node%0A%0A%09public Node()%7B%0A%09%09parent = left = right = null;%0A%09%09data = null;%0A%09%09postorderN = preorderN = inorderN = -1;%09%0A%09%7D%0A%0A%09public Node(Integer value)%7B%0A%09%09this();%0A%09%09data = value;%0A%09%7D%0A%0A%7D

Create Node class