| Feature | Benefit for DASS 341 | |---------|----------------------| | | Teaches reference vs. object distinction. | | Strong type system | Reduces runtime errors, enforces design thinking. | | Rich Collections Framework | ArrayList , LinkedList , PriorityQueue allow contrast of implementations. | | Cross-platform | Code written on any OS runs the same. | | Industry standard | Many enterprise backends and Android apps use Java. |
// Main method for testing public static void main(String[] args) BST tree = new BST(); int[] values = 50, 30, 20, 40, 70, 60, 80; for (int v : values) tree.insert(v); System.out.print("In-order traversal: "); tree.inorder(); // Output: 20 30 40 50 60 70 80
A: Common choices include “Introduction to Algorithms” (CLRS) and “Data Structures and Algorithms in Java” by Robert Lafore or Michael T. Goodrich.
// Recursive helper for insertion private Node insertRec(Node root, int key) if (root == null) root = new Node(key); return root; if (key < root.key) root.left = insertRec(root.left, key); else if (key > root.key) root.right = insertRec(root.right, key); return root;
// Public method to insert a key (English documentation) public void insert(int key) root = insertRec(root, key);
