ACCOUNTS Lecture Notes - Lecture 3: Doubly Linked List, Backtracking, Bubble Sort
11 views2 pages
Document Summary
A collection of elements of the same data type, stored in contiguous memory locations. Can be initialized with a fixed size or dynamically resized. Basic operations include accessing, inserting, and deleting elements. In java, arrays are objects and have a fixed length that cannot be changed after creation. A collection of elements called nodes, where each node contains a value and a pointer to the next node in the list. Can be singly or doubly linked, where each node also contains a pointer to the previous node in a doubly linked list. Basic operations include inserting, deleting, and searching for elements. In java, linked lists are implemented using the linkedlist class in the java. util package. A collection of elements that follow the last-in-first-out (lifo) principle. Basic operations include pushing elements onto the stack and popping elements off the stack. In java, stacks are implemented using the stack class in the java. util package.
Get access
Grade+
$40 USD/m
Billed monthly
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
10 Verified Answers
Class+
$30 USD/m
Billed monthly
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
7 Verified Answers