- Major-related courses
- /
- SICI 4036
IDE
Requirements:
Diagram
The image contains a Java class diagram illustrating IntLinkedStack, IntLinkedQueue and IntBinarySearchTree, along with their corresponding interfaces: IntStack, IntQueue and IntBST.
Write a Java program using the Interface provided to create the class of Stack, Queue, and Binary Search Tree (BST) using a linked list for integer numbers.
- Add
- Remove
- isEmpty
- size
- sum
- average
- minimum
- maximum
- linearSearch
- sumOfSquares
- Count odd elements
- Count even elements
- Count occurrences of an element
Solution
The IntLinkedQueue uses nodes to store integers in a linked list, following the FIFO (First-In-First-Out) principle for enqueue and dequeue operations. The IntLinkedStack employs nodes in a linked list, to the LIFO (Last-In-First-Out) principle for push and pop operations. The IntBinarySearchTree organizes nodes in a hierarchical structure, ensuring efficient insertion, deletion, and search operations using the binary search property. The app LinkedDataStructure is a Java application that shows how linked data structures are used.
- Queue Implementation: IntLinkedQueue.java, IntQueue.java
- Stack Implementation: IntLinkedStack.java, IntStack.java
- BST Implementation: IntBST.java, IntBinarySearchTree.java
- Application: LinkedDataStructureApp.java
- Exception Handling: EmptyCollectionException.java