title
Linked List in Java

description
Get the Code: http://goo.gl/T40EF In this video, I'll cover how work with a linked list in java. I'll show you how they work in 4 different ways. We'll cover how to create them, what a link is, how to add and delete links, how to search through them and a whole bunch more. The basics you need to understand at the end are that: 1. A Link is an Object 2. Each Link has a reference to another Link in the List 3. The LinkedList has only a reference to the last Link added to it.

detail
{'title': 'Linked List in Java', 'heatmap': [{'end': 186.552, 'start': 135.395, 'weight': 0.711}, {'end': 235.841, 'start': 186.912, 'weight': 0.702}, {'end': 320.189, 'start': 256.214, 'weight': 0.819}, {'end': 395.153, 'start': 327.81, 'weight': 0.758}, {'end': 724.387, 'start': 696.743, 'weight': 0.753}, {'end': 881.524, 'start': 863.461, 'weight': 0.725}, {'end': 938.462, 'start': 910.859, 'weight': 0.799}], 'summary': "'linked list in java' covers creating, modifying, and searching through linked lists, implementing a linked list for a book inventory, and explaining basic concepts, structure, and operations of linked lists with practical demonstrations and code examples.", 'chapters': [{'end': 192.994, 'segs': [{'end': 69.846, 'src': 'embed', 'start': 0.109, 'weight': 0, 'content': [{'end': 6.194, 'text': 'Well hello Internet and welcome to my tutorial on linked lists and how they are used with Java.', 'start': 0.109, 'duration': 6.085}, {'end': 11.439, 'text': "We're going to cover how to make them, how to change them, how to search through them, and a whole bunch of other things.", 'start': 6.334, 'duration': 5.105}, {'end': 17.584, 'text': "And I'm going to present this in numerous different ways so by the end of the tutorial you will completely understand linked lists.", 'start': 11.559, 'duration': 6.025}, {'end': 18.585, 'text': "So let's get into it.", 'start': 17.804, 'duration': 0.781}, {'end': 24.59, 'text': 'So what is a linked list? Well first what you have to understand is a link is just simply an object.', 'start': 18.645, 'duration': 5.945}, {'end': 30.176, 'text': 'And each link that you create has a reference to another link in the list.', 'start': 24.93, 'duration': 5.246}, {'end': 33.7, 'text': 'And the linked list is just another class.', 'start': 30.436, 'duration': 3.264}, {'end': 39.347, 'text': 'And it has only one reference to one of the links in the linked list.', 'start': 34.021, 'duration': 5.326}, {'end': 42.951, 'text': 'And that is the last link that was added.', 'start': 39.647, 'duration': 3.304}, {'end': 45.734, 'text': "So let's look at this in pictures to make more sense of that.", 'start': 43.111, 'duration': 2.623}, {'end': 49.236, 'text': "Basically this is all that's to it what you see here on the screen.", 'start': 45.834, 'duration': 3.402}, {'end': 61.402, 'text': 'You have one guy right here and his name is linked list, and he is just a simple object, and in regards to all of the links in the linked list,', 'start': 49.416, 'duration': 11.986}, {'end': 69.846, 'text': 'he only has the address for the newest guy in town or the last link that was added to the list.', 'start': 61.402, 'duration': 8.444}], 'summary': 'Tutorial on linked lists in java, covering creation, modification, and search. aims for full understanding by the end of the tutorial.', 'duration': 69.737, 'max_score': 0.109, 'thumbnail': 'https://coursnap.oss-ap-southeast-1.aliyuncs.com/video-capture/195KUinjBpU/pics/195KUinjBpU109.jpg'}, {'end': 191.474, 'src': 'heatmap', 'start': 129.372, 'weight': 1, 'content': [{'end': 135.215, 'text': "So I'm going to have book name, and I'm setting this for public so I don't have to worry about getters and setters and all that stuff.", 'start': 129.372, 'duration': 5.843}, {'end': 138.416, 'text': "Then I'm going to have millions sold.", 'start': 135.395, 'duration': 3.021}, {'end': 144.422, 'text': 'So each link that we create is going to have a book name and the millions of those books that were sold.', 'start': 138.716, 'duration': 5.706}, {'end': 149.488, 'text': 'Then what do I need to do? Well, I need to reference the next link in the linked list.', 'start': 144.603, 'duration': 4.885}, {'end': 157.016, 'text': 'And like you saw before, that guy, of course, is going to be a link and its name is going to be next, just like we saw previously.', 'start': 149.548, 'duration': 7.468}, {'end': 166.458, 'text': "Then, just simply, I'm going to create a constructor here, the million sold, and then assign the book name, and the millions of books sold.", 'start': 157.316, 'duration': 9.142}, {'end': 167.338, 'text': 'And there we are.', 'start': 166.658, 'duration': 0.68}, {'end': 171.339, 'text': "Like I said, linked lists are confusing, only because they're a little bit weird.", 'start': 167.598, 'duration': 3.741}, {'end': 175.1, 'text': "But once you understand that previous frame that I just showed you, they're not that hard.", 'start': 171.519, 'duration': 3.581}, {'end': 179.281, 'text': "Okay, well then, what I'm going to do is I'm going to put in display,", 'start': 175.34, 'duration': 3.941}, {'end': 184.902, 'text': 'and all display is going to do is provide us a little bit of information on our books.', 'start': 179.281, 'duration': 5.621}, {'end': 186.552, 'text': 'which are our links.', 'start': 185.512, 'duration': 1.04}, {'end': 191.474, 'text': "So that's going to put out the book name, the millions of books sold, and there we are.", 'start': 186.912, 'duration': 4.562}], 'summary': 'Creating a linked list with book names and millions sold, and implementing display function.', 'duration': 62.102, 'max_score': 129.372, 'thumbnail': 'https://coursnap.oss-ap-southeast-1.aliyuncs.com/video-capture/195KUinjBpU/pics/195KUinjBpU129372.jpg'}, {'end': 199.756, 'src': 'embed', 'start': 171.519, 'weight': 2, 'content': [{'end': 175.1, 'text': "But once you understand that previous frame that I just showed you, they're not that hard.", 'start': 171.519, 'duration': 3.581}, {'end': 179.281, 'text': "Okay, well then, what I'm going to do is I'm going to put in display,", 'start': 175.34, 'duration': 3.941}, {'end': 184.902, 'text': 'and all display is going to do is provide us a little bit of information on our books.', 'start': 179.281, 'duration': 5.621}, {'end': 186.552, 'text': 'which are our links.', 'start': 185.512, 'duration': 1.04}, {'end': 191.474, 'text': "So that's going to put out the book name, the millions of books sold, and there we are.", 'start': 186.912, 'duration': 4.562}, {'end': 192.994, 'text': "So that's all display is going to do.", 'start': 191.694, 'duration': 1.3}, {'end': 199.756, 'text': 'I mean technically we did pretty much everything we needed to do with linked list, just having data inside of it and having next.', 'start': 193.194, 'duration': 6.562}], 'summary': "Using 'display' provides book name and millions of books sold", 'duration': 28.237, 'max_score': 171.519, 'thumbnail': 'https://coursnap.oss-ap-southeast-1.aliyuncs.com/video-capture/195KUinjBpU/pics/195KUinjBpU171519.jpg'}], 'start': 0.109, 'title': 'Linked lists in java', 'summary': 'Covers the concept of linked lists in java, and emphasizes creating, modifying, and searching through linked lists to achieve a comprehensive understanding. it also discusses the implementation of a linked list for a book inventory, including the creation of links with book names and the number of millions sold, the reference to the next link, and the display function for book information.', 'chapters': [{'end': 128.972, 'start': 0.109, 'title': 'Understanding linked lists in java', 'summary': 'Covers the concept of linked lists in java, explaining the structure of a linked list and how it functions through references, and it emphasizes creating, modifying, and searching through linked lists to achieve a comprehensive understanding.', 'duration': 128.863, 'highlights': ['The chapter emphasizes covering the concept of linked lists in Java, addressing their creation, modification, and search operations to ensure a thorough understanding.', 'A linked list is a class with references to links, each link containing an address of the next link, and the last link added is referenced by the linked list itself.', 'The structure of a linked list involves each link having a reference to the previous link, forming a chain-like structure that is accessed through the linked list class.']}, {'end': 192.994, 'start': 129.372, 'title': 'Linked list implementation', 'summary': 'Discusses the implementation of a linked list for a book inventory, including the creation of links with book names and the number of millions sold, the reference to the next link, and the display function for book information.', 'duration': 63.622, 'highlights': ['The chapter introduces the implementation of a linked list for book inventory, including the creation of links with book names and millions sold, and the reference to the next link.', 'The display function provides information on the book name and the millions of books sold, aiding in the understanding of linked lists.', 'The chapter emphasizes the simplicity of linked lists once the concept of the previous frame is understood.']}], 'duration': 192.885, 'thumbnail': 'https://coursnap.oss-ap-southeast-1.aliyuncs.com/video-capture/195KUinjBpU/pics/195KUinjBpU109.jpg', 'highlights': ['The chapter emphasizes covering the concept of linked lists in Java, addressing their creation, modification, and search operations to ensure a thorough understanding.', 'The chapter introduces the implementation of a linked list for book inventory, including the creation of links with book names and millions sold, and the reference to the next link.', 'The display function provides information on the book name and the millions of books sold, aiding in the understanding of linked lists.', 'A linked list is a class with references to links, each link containing an address of the next link, and the last link added is referenced by the linked list itself.', 'The structure of a linked list involves each link having a reference to the previous link, forming a chain-like structure that is accessed through the linked list class.', 'The chapter emphasizes the simplicity of linked lists once the concept of the previous frame is understood.']}, {'end': 469.521, 'segs': [{'end': 301.88, 'src': 'embed', 'start': 256.214, 'weight': 0, 'content': [{'end': 265.559, 'text': "Then if I want to check if my linked list is empty all I'm going to need to do is check if first link is equal to null.", 'start': 256.214, 'duration': 9.345}, {'end': 269.413, 'text': 'If it is that means that Nobody has moved into town yet.', 'start': 265.899, 'duration': 3.514}, {'end': 274.457, 'text': "So now let's take a quick look at how to insert a new link into a linked list.", 'start': 269.553, 'duration': 4.904}, {'end': 278.701, 'text': 'To insert a new link into our linked list, a new link needs to be created.', 'start': 274.857, 'duration': 3.844}, {'end': 284.986, 'text': 'Its next field is going to be assigned to the reference to the previous link that was created.', 'start': 279.001, 'duration': 5.985}, {'end': 290.731, 'text': "And the linked list's first link field is assigned a reference to the newest link added.", 'start': 285.267, 'duration': 5.464}, {'end': 292.193, 'text': "Let's take a look at that as pictures.", 'start': 290.871, 'duration': 1.322}, {'end': 294.815, 'text': "So we're going to create ourselves a new link.", 'start': 292.453, 'duration': 2.362}, {'end': 296.917, 'text': 'that we want to add to our linked list.', 'start': 295.095, 'duration': 1.822}, {'end': 301.88, 'text': "We're going to take the value of first link that is in the linked list,", 'start': 297.077, 'duration': 4.803}], 'summary': 'To check if the linked list is empty, check if first link is equal to null. to insert a new link, create a new link with next field assigned to the reference of the previous link, and update the first link field.', 'duration': 45.666, 'max_score': 256.214, 'thumbnail': 'https://coursnap.oss-ap-southeast-1.aliyuncs.com/video-capture/195KUinjBpU/pics/195KUinjBpU256214.jpg'}, {'end': 320.189, 'src': 'heatmap', 'start': 256.214, 'weight': 0.819, 'content': [{'end': 265.559, 'text': "Then if I want to check if my linked list is empty all I'm going to need to do is check if first link is equal to null.", 'start': 256.214, 'duration': 9.345}, {'end': 269.413, 'text': 'If it is that means that Nobody has moved into town yet.', 'start': 265.899, 'duration': 3.514}, {'end': 274.457, 'text': "So now let's take a quick look at how to insert a new link into a linked list.", 'start': 269.553, 'duration': 4.904}, {'end': 278.701, 'text': 'To insert a new link into our linked list, a new link needs to be created.', 'start': 274.857, 'duration': 3.844}, {'end': 284.986, 'text': 'Its next field is going to be assigned to the reference to the previous link that was created.', 'start': 279.001, 'duration': 5.985}, {'end': 290.731, 'text': "And the linked list's first link field is assigned a reference to the newest link added.", 'start': 285.267, 'duration': 5.464}, {'end': 292.193, 'text': "Let's take a look at that as pictures.", 'start': 290.871, 'duration': 1.322}, {'end': 294.815, 'text': "So we're going to create ourselves a new link.", 'start': 292.453, 'duration': 2.362}, {'end': 296.917, 'text': 'that we want to add to our linked list.', 'start': 295.095, 'duration': 1.822}, {'end': 301.88, 'text': "We're going to take the value of first link that is in the linked list,", 'start': 297.077, 'duration': 4.803}, {'end': 310.267, 'text': 'store that inside of next and then store a reference to link as the value or reference in the field named first link.', 'start': 301.88, 'duration': 8.387}, {'end': 312.567, 'text': 'All this stuff just moves to the right.', 'start': 310.487, 'duration': 2.08}, {'end': 313.988, 'text': "That's all it does.", 'start': 312.767, 'duration': 1.221}, {'end': 320.189, 'text': 'Remember linked list knows about the newest guy that moves into town and the newest guy that moves into town is named first link.', 'start': 314.268, 'duration': 5.921}], 'summary': 'To check for an empty linked list, verify if the first link is null. inserting a new link involves creating a new link and updating references.', 'duration': 63.975, 'max_score': 256.214, 'thumbnail': 'https://coursnap.oss-ap-southeast-1.aliyuncs.com/video-capture/195KUinjBpU/pics/195KUinjBpU256214.jpg'}, {'end': 405.522, 'src': 'heatmap', 'start': 327.81, 'weight': 2, 'content': [{'end': 329.331, 'text': "So let's build that in code.", 'start': 327.81, 'duration': 1.521}, {'end': 335.992, 'text': "So we're going to go public void insert first link and this is just going to be a string again.", 'start': 329.451, 'duration': 6.541}, {'end': 337.256, 'text': 'Let me just grab that.', 'start': 336.292, 'duration': 0.964}, {'end': 339.263, 'text': "So it's going to be Book Name and Million Sold.", 'start': 337.457, 'duration': 1.806}, {'end': 340.868, 'text': "I don't like to type if I don't have to.", 'start': 339.283, 'duration': 1.585}, {'end': 344.11, 'text': 'And all the code that is here is available in a link underneath the video.', 'start': 341.209, 'duration': 2.901}, {'end': 345.271, 'text': "And then we're going to go New.", 'start': 344.23, 'duration': 1.041}, {'end': 348.412, 'text': "We're going to create a new link because a new guy just moved into town.", 'start': 345.291, 'duration': 3.121}, {'end': 351.673, 'text': "And we're going to assign his name and how many books he sold.", 'start': 348.612, 'duration': 3.061}, {'end': 352.373, 'text': 'So there we go.', 'start': 351.853, 'duration': 0.52}, {'end': 354.574, 'text': 'We created a new link, just like I said before.', 'start': 352.413, 'duration': 2.161}, {'end': 360.597, 'text': 'Now I just need to connect the first link field that is stored inside of the link list to the new link.', 'start': 354.594, 'duration': 6.003}, {'end': 361.777, 'text': 'So I go New Link.', 'start': 360.817, 'duration': 0.96}, {'end': 366.759, 'text': 'Next You now know the address for the guy that moved into town previous to you.', 'start': 362.097, 'duration': 4.662}, {'end': 368.68, 'text': 'And that is stored inside of Next.', 'start': 367.019, 'duration': 1.661}, {'end': 373.562, 'text': 'And then I just go first link is now equal to the last guy to move into town.', 'start': 369.096, 'duration': 4.466}, {'end': 374.464, 'text': "And that's all I do.", 'start': 373.743, 'duration': 0.721}, {'end': 377.288, 'text': 'And I just added that guy into our linked list.', 'start': 374.744, 'duration': 2.544}, {'end': 382.095, 'text': "So now let's look at how to remove the very last guy that moved into town.", 'start': 377.548, 'duration': 4.547}, {'end': 385.783, 'text': 'To remove the last guy that moved into town.', 'start': 383.2, 'duration': 2.583}, {'end': 394.092, 'text': "the length list's first link field is just simply going to be assigned the value of the current first link's value for next.", 'start': 385.783, 'duration': 8.309}, {'end': 395.153, 'text': 'That is it.', 'start': 394.512, 'duration': 0.641}, {'end': 396.414, 'text': "Let's look at that in pictures.", 'start': 395.313, 'duration': 1.101}, {'end': 405.522, 'text': 'So if we want to remove this guy right here, well, first link has a reference to this link here stored inside a first link.', 'start': 396.734, 'duration': 8.788}], 'summary': 'Code demonstrates inserting and removing links in a linked list.', 'duration': 77.712, 'max_score': 327.81, 'thumbnail': 'https://coursnap.oss-ap-southeast-1.aliyuncs.com/video-capture/195KUinjBpU/pics/195KUinjBpU327810.jpg'}], 'start': 193.194, 'title': 'Linked list fundamentals', 'summary': 'Covers basic concepts of a linked list including its structure, checking for emptiness, and inserting a new link. it also explains adding and removing elements with code and visual representation.', 'chapters': [{'end': 354.574, 'start': 193.194, 'title': 'Linked list basics', 'summary': 'Discusses the basic concepts of a linked list, including the structure of a link, how to check if the list is empty, and the process of inserting a new link, with an example of inserting the first link and its details.', 'duration': 161.38, 'highlights': ["A linked list contains links with data and a reference to the next link, and a toString method that returns the book's name. The basic structure of a link in a linked list and the functionality of the toString method.", 'The process of defining the LinkList and the initial setup of the FirstLink with a reference to the first link in the list. Explanation of setting up the LinkList and the initial reference to the first link in the list.', 'The method to check if the linked list is empty by verifying if the first link is equal to null. How to determine if the linked list is empty by checking the value of the first link.', 'The process of inserting a new link into the linked list involves creating a new link, assigning its next field to the reference of the previous link, and updating the first link field of the linked list with the reference of the new link. Details on how a new link is inserted into the linked list and the necessary assignments involved.']}, {'end': 469.521, 'start': 354.594, 'title': 'Linked list operations', 'summary': 'Explains how to add and remove elements from a linked list, specifying the process for adding a new link and removing the last link, with the code and visual representation.', 'duration': 114.927, 'highlights': ['The process of adding a new link involves connecting the first link field to the new link and updating the references, ultimately adding the new link to the linked list.', "To remove the last link from the list, the first link field is assigned the value of the current first link's 'next' value, effectively removing the last link.", 'The code snippet demonstrates the removal process by assigning the first link as a reference to the last element, checking if the list is empty, and returning the deleted link if applicable.']}], 'duration': 276.327, 'thumbnail': 'https://coursnap.oss-ap-southeast-1.aliyuncs.com/video-capture/195KUinjBpU/pics/195KUinjBpU193194.jpg', 'highlights': ['The process of inserting a new link into the linked list involves creating a new link, assigning its next field to the reference of the previous link, and updating the first link field of the linked list with the reference of the new link.', 'The process of adding a new link involves connecting the first link field to the new link and updating the references, ultimately adding the new link to the linked list.', "To remove the last link from the list, the first link field is assigned the value of the current first link's 'next' value, effectively removing the last link.", 'The method to check if the linked list is empty by verifying if the first link is equal to null. How to determine if the linked list is empty by checking the value of the first link.']}, {'end': 1058.033, 'segs': [{'end': 508.583, 'src': 'embed', 'start': 483.673, 'weight': 0, 'content': [{'end': 491.936, 'text': "we're going to be cycling through first the last guy to move into town and then the guy that moved into town previous to that and then the guy that moved into town previous to that.", 'start': 483.673, 'duration': 8.263}, {'end': 502.56, 'text': 'So we just start at the reference stored in first link inside the linked list object and then we get the references stored in next for every link until next returns a value for null.', 'start': 492.156, 'duration': 10.404}, {'end': 504.141, 'text': 'This is what it looks like in pictures.', 'start': 502.68, 'duration': 1.461}, {'end': 508.583, 'text': "We say, hey, first link, who's the last guy that moved into town? It provides that answer.", 'start': 504.221, 'duration': 4.362}], 'summary': 'Cycling through linked list to find recent town movers.', 'duration': 24.91, 'max_score': 483.673, 'thumbnail': 'https://coursnap.oss-ap-southeast-1.aliyuncs.com/video-capture/195KUinjBpU/pics/195KUinjBpU483673.jpg'}, {'end': 606.023, 'src': 'embed', 'start': 575.633, 'weight': 2, 'content': [{'end': 577.994, 'text': "It's going to just print out the book name and the million sold.", 'start': 575.633, 'duration': 2.361}, {'end': 584.663, 'text': "And then let's say we also want to print out the next link value that is stored in each one of these books.", 'start': 578.274, 'duration': 6.389}, {'end': 587.486, 'text': "To do that we're just going to go the link next.", 'start': 585.083, 'duration': 2.403}, {'end': 590.951, 'text': "See that's the reason why I didn't want to use getters and setters and confuse everything.", 'start': 587.506, 'duration': 3.445}, {'end': 593.034, 'text': "Then what I'm going to do is say okay, well,", 'start': 591.111, 'duration': 1.923}, {'end': 600.379, 'text': 'the current the link we want to get the address for The next guy we want to look at in town and just get the value of next for that.', 'start': 593.034, 'duration': 7.345}, {'end': 602.22, 'text': "And then I'm just going to throw a new line in there.", 'start': 600.559, 'duration': 1.661}, {'end': 606.023, 'text': 'So how exactly are we going to be able to find a link in a linked list?', 'start': 602.46, 'duration': 3.563}], 'summary': 'Printing book names and sales, accessing next link value in a linked list.', 'duration': 30.39, 'max_score': 575.633, 'thumbnail': 'https://coursnap.oss-ap-southeast-1.aliyuncs.com/video-capture/195KUinjBpU/pics/195KUinjBpU575633.jpg'}, {'end': 733.73, 'src': 'heatmap', 'start': 696.743, 'weight': 1, 'content': [{'end': 702.109, 'text': "Else we're going to get here if we found a matching link inside the linked list We're going to assign.", 'start': 696.743, 'duration': 5.366}, {'end': 705.651, 'text': 'the link is going to be equal to the reference inside of next.', 'start': 702.109, 'duration': 3.542}, {'end': 708.692, 'text': "Then we're going to bounce down here and do an else.", 'start': 705.971, 'duration': 2.721}, {'end': 711.713, 'text': "And we're going to say empty linked list.", 'start': 709.092, 'duration': 2.621}, {'end': 713.033, 'text': 'Print that out on a screen.', 'start': 711.913, 'duration': 1.12}, {'end': 718.055, 'text': "Otherwise, we know we got a link or a match and we're going to return it.", 'start': 713.273, 'duration': 4.782}, {'end': 724.387, 'text': "So how are we going to remove a specific link? This looks a little bit more complicated but don't worry about it.", 'start': 718.295, 'duration': 6.092}, {'end': 727.808, 'text': "What we're going to do is we're going to cycle through all the links until there is a match.", 'start': 724.507, 'duration': 3.301}, {'end': 728.949, 'text': 'You already know how to do that.', 'start': 727.848, 'duration': 1.101}, {'end': 733.73, 'text': 'If the reference link stored in linked lists first link matches,', 'start': 729.209, 'duration': 4.521}], 'summary': 'Removing a specific link by cycling through all links until a match is found.', 'duration': 36.987, 'max_score': 696.743, 'thumbnail': 'https://coursnap.oss-ap-southeast-1.aliyuncs.com/video-capture/195KUinjBpU/pics/195KUinjBpU696743.jpg'}, {'end': 891.866, 'src': 'heatmap', 'start': 863.461, 'weight': 0.725, 'content': [{'end': 868.402, 'text': "we're going to go current link next and that's going to get us the next guy in the neighborhood that we want to search for,", 'start': 863.461, 'duration': 4.941}, {'end': 869.602, 'text': "and that's going to be current link.", 'start': 868.402, 'duration': 1.2}, {'end': 870.222, 'text': 'There we go.', 'start': 869.742, 'duration': 0.48}, {'end': 874.463, 'text': 'Then down here, if current link is equal to first link, remember,', 'start': 870.442, 'duration': 4.021}, {'end': 881.524, 'text': "there were two different ways of solving this one if we got a match for the first link and one if we got a match that wasn't in the first link.", 'start': 874.463, 'duration': 7.061}, {'end': 884.724, 'text': "We're going to handle the first link first, because if we get here,", 'start': 881.644, 'duration': 3.08}, {'end': 891.866, 'text': "that basically just means there was a match in the reference stored in first link inside of linked list, so it's very easy to remove an item.", 'start': 884.724, 'duration': 7.142}], 'summary': 'Using current link to search for and handle matches in the linked list.', 'duration': 28.405, 'max_score': 863.461, 'thumbnail': 'https://coursnap.oss-ap-southeast-1.aliyuncs.com/video-capture/195KUinjBpU/pics/195KUinjBpU863461.jpg'}, {'end': 938.462, 'src': 'heatmap', 'start': 910.859, 'weight': 0.799, 'content': [{'end': 913.442, 'text': 'Next is equal to current link.', 'start': 910.859, 'duration': 2.583}, {'end': 914.783, 'text': 'Next Like that.', 'start': 913.742, 'duration': 1.041}, {'end': 920.489, 'text': "And then of course, since we want to return whatever was deleted, we're going to return current link.", 'start': 914.943, 'duration': 5.546}, {'end': 921.49, 'text': "So let's save that.", 'start': 920.629, 'duration': 0.861}, {'end': 924.754, 'text': "Let's jump up here inside of main and start executing some stuff.", 'start': 921.53, 'duration': 3.224}, {'end': 930.58, 'text': "Now the very first thing that we're going to have to do inside of this is create a new link list.", 'start': 925.875, 'duration': 4.705}, {'end': 933.703, 'text': 'New link list is equal to new link list.', 'start': 930.94, 'duration': 2.763}, {'end': 938.462, 'text': "And then if we want to insert new links or new books that's real easy.", 'start': 934.059, 'duration': 4.403}], 'summary': 'Creating and inserting new links in a link list.', 'duration': 27.603, 'max_score': 910.859, 'thumbnail': 'https://coursnap.oss-ap-southeast-1.aliyuncs.com/video-capture/195KUinjBpU/pics/195KUinjBpU910859.jpg'}], 'start': 469.781, 'title': 'Linked lists', 'summary': 'Covers cycling through a linked list, basics of linked lists, including operations like searching, removing, and displaying elements, with practical demonstrations and code examples.', 'chapters': [{'end': 651.123, 'start': 469.781, 'title': 'Cycling through a linked list', 'summary': 'Explains how to cycle through a linked list, starting from the last link and moving through each link until reaching the end, using code to display and print the book names and the next link values.', 'duration': 181.342, 'highlights': ["Cycling through a linked list involves starting at the reference stored in the first link and moving through each link until 'next' returns a value of null. ", 'Using a while loop to iterate through the list, displaying the book name and the million sold for each link, and printing the next link value for each book. ', "Finding a link in a linked list involves checking the data for the first link reference stored in the linked list and continuing to search every reference stored inside each object's 'next' value until reaching the end of the list. "]}, {'end': 1058.033, 'start': 651.445, 'title': 'Linked list basics', 'summary': 'Explains the basics of linked lists, including searching, removing, and displaying elements, with code examples and practical demonstrations. it also covers inserting, displaying, and removing elements from the linked list, as well as searching for specific elements.', 'duration': 406.588, 'highlights': ['The chapter explains the basics of linked lists, including searching, removing, and displaying elements. It covers the fundamental operations of linked lists, such as searching for specific elements and removing items from the list.', 'Practical demonstrations and code examples are used to illustrate the concepts. The chapter provides practical demonstrations and code examples to illustrate the concepts, making it easier for readers to understand the implementation.', 'Inserting, displaying, and removing elements from the linked list are demonstrated with practical examples. The process of inserting, displaying, and removing elements from the linked list is demonstrated with practical examples, enhancing the understanding of these operations.', 'Searching for specific elements in the linked list is explained with practical demonstrations. The chapter explains the process of searching for specific elements in the linked list, with practical demonstrations to aid in understanding this operation.']}], 'duration': 588.252, 'thumbnail': 'https://coursnap.oss-ap-southeast-1.aliyuncs.com/video-capture/195KUinjBpU/pics/195KUinjBpU469781.jpg', 'highlights': ["Cycling through a linked list involves starting at the reference stored in the first link and moving through each link until 'next' returns a value of null.", 'The chapter explains the basics of linked lists, including searching, removing, and displaying elements. It covers the fundamental operations of linked lists, such as searching for specific elements and removing items from the list.', 'Using a while loop to iterate through the list, displaying the book name and the million sold for each link, and printing the next link value for each book.', 'Practical demonstrations and code examples are used to illustrate the concepts. The chapter provides practical demonstrations and code examples to illustrate the concepts, making it easier for readers to understand the implementation.']}], 'highlights': ['The chapter introduces the implementation of a linked list for book inventory, including the creation of links with book names and millions sold, and the reference to the next link.', 'The process of inserting a new link into the linked list involves creating a new link, assigning its next field to the reference of the previous link, and updating the first link field of the linked list with the reference of the new link.', 'The chapter emphasizes covering the concept of linked lists in Java, addressing their creation, modification, and search operations to ensure a thorough understanding.', 'The process of adding a new link involves connecting the first link field to the new link and updating the references, ultimately adding the new link to the linked list.', "Cycling through a linked list involves starting at the reference stored in the first link and moving through each link until 'next' returns a value of null."]}