<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/">
  <channel>
    <title>DEV Community: gitSushi</title>
    <description>The latest articles on DEV Community by gitSushi (@gitsushi).</description>
    <link>https://dev.to/gitsushi</link>
    <image>
      <url>https://media2.dev.to/dynamic/image/width=90,height=90,fit=cover,gravity=auto,format=auto/https:%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F346300%2Ff8b13adc-a2fc-4d81-9ed9-6d5cba8f6adb.png</url>
      <title>DEV Community: gitSushi</title>
      <link>https://dev.to/gitsushi</link>
    </image>
    <atom:link rel="self" type="application/rss+xml" href="https://dev.to/feed/gitsushi"/>
    <language>en</language>
    <item>
      <title>Data Structures</title>
      <dc:creator>gitSushi</dc:creator>
      <pubDate>Thu, 15 Oct 2020 19:12:27 +0000</pubDate>
      <link>https://dev.to/gitsushi/data-structures-5cpj</link>
      <guid>https://dev.to/gitsushi/data-structures-5cpj</guid>
      <description>&lt;h2&gt;
  
  
  Data structures in Javascript for beginners
&lt;/h2&gt;

&lt;p&gt;Javascript has the convenient built-in data structure : the array. This article looks into other data structures and how to code that structure, most starting with a node.&lt;/p&gt;

&lt;h3&gt;
  
  
  Content
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;The Node&lt;/li&gt;
&lt;li&gt;
Stack and Queue

&lt;ul&gt;
&lt;li&gt;Stack&lt;/li&gt;
&lt;li&gt;Queue&lt;/li&gt;
&lt;/ul&gt;


&lt;/li&gt;
&lt;li&gt;
Linked List

&lt;ul&gt;
&lt;li&gt;Singly Linked List&lt;/li&gt;
&lt;li&gt;Doubly Linked List&lt;/li&gt;
&lt;/ul&gt;


&lt;/li&gt;
&lt;li&gt;Hash Table&lt;/li&gt;
&lt;li&gt;
Tree

&lt;ul&gt;
&lt;li&gt;Binary Tree&lt;/li&gt;
&lt;/ul&gt;


&lt;/li&gt;
&lt;/ul&gt;

&lt;h2&gt;
  
  
  The Node
&lt;/h2&gt;


&lt;div class="ltag_speakerdeck"&gt;
  &lt;iframe height="463" id="talk_frame_7ce281b523ae43178f4c5f52277bf092" src="//speakerdeck.com/player/7ce281b523ae43178f4c5f52277bf092" width="710"&gt;&lt;/iframe&gt;
&lt;/div&gt;


&lt;h2&gt;
  
  
  Stack and Queue
&lt;/h2&gt;

&lt;p&gt;Stack and queue could very well be using arrays, it would in fact be easier. However as said earlier, this article's standpoint is to write the structure ourselves.&lt;/p&gt;


&lt;div class="ltag_speakerdeck"&gt;
  &lt;iframe height="463" id="talk_frame_e4cb487760a347fcb6e2438eff66cb4b" src="//speakerdeck.com/player/e4cb487760a347fcb6e2438eff66cb4b" width="710"&gt;&lt;/iframe&gt;
&lt;/div&gt;


&lt;h3&gt;
  
  
  Stack
&lt;/h3&gt;

&lt;p&gt;We will be using functions and closures to build our stack.&lt;/p&gt;


&lt;div class="ltag_speakerdeck"&gt;
  &lt;iframe height="463" id="talk_frame_7b549ce76f0e48e5b0907fd5dccdbaaa" src="//speakerdeck.com/player/7b549ce76f0e48e5b0907fd5dccdbaaa" width="710"&gt;&lt;/iframe&gt;
&lt;/div&gt;


&lt;p&gt;&lt;a href="https://codepen.io/gitsushi/pen/poyBJJy/right?editors=0012"&gt;Edit the Stack on Codepen&lt;/a&gt;&lt;/p&gt;

&lt;h3&gt;
  
  
  Queue
&lt;/h3&gt;

&lt;p&gt;We will be using classes to build our queue.&lt;/p&gt;


&lt;div class="ltag_speakerdeck"&gt;
  &lt;iframe height="463" id="talk_frame_de7f561286144d2f96fffa3222aff110" src="//speakerdeck.com/player/de7f561286144d2f96fffa3222aff110" width="710"&gt;&lt;/iframe&gt;
&lt;/div&gt;


&lt;p&gt;&lt;a href="https://codepen.io/gitsushi/pen/jOqjMwp/right?editors=0012"&gt;Edit the Queue on Codepen&lt;/a&gt;&lt;/p&gt;

&lt;h2&gt;
  
  
  Linked List
&lt;/h2&gt;


&lt;div class="ltag_speakerdeck"&gt;
  &lt;iframe height="463" id="talk_frame_057d8abc205f4ffe998dfdd0ebc2f5ee" src="//speakerdeck.com/player/057d8abc205f4ffe998dfdd0ebc2f5ee" width="710"&gt;&lt;/iframe&gt;
&lt;/div&gt;


&lt;p&gt;There are different types of linked list. Let's review in details some of them.&lt;/p&gt;

&lt;h3&gt;
  
  
  Singly Linked List
&lt;/h3&gt;


&lt;div class="ltag_speakerdeck"&gt;
  &lt;iframe height="463" id="talk_frame_303e03bee5084a738d2c4a587b829b4c" src="//speakerdeck.com/player/303e03bee5084a738d2c4a587b829b4c" width="710"&gt;&lt;/iframe&gt;
&lt;/div&gt;


&lt;p&gt;&lt;a href="https://codepen.io/gitsushi/pen/xxVBOxN/right?editors=0012"&gt;Edit the Singly Linked List on Codepen&lt;/a&gt;&lt;/p&gt;

&lt;h3&gt;
  
  
  Doubly Linked List
&lt;/h3&gt;


&lt;div class="ltag_speakerdeck"&gt;
  &lt;iframe height="463" id="talk_frame_54455b1733e1485ba8de4fb7fd5775ad" src="//speakerdeck.com/player/54455b1733e1485ba8de4fb7fd5775ad" width="710"&gt;&lt;/iframe&gt;
&lt;/div&gt;


&lt;p&gt;&lt;a href="https://codepen.io/gitsushi/pen/YzqBaMr/right?editors=0012"&gt;Edit the Doubly Linked List on Codepen&lt;/a&gt;&lt;/p&gt;

&lt;h2&gt;
  
  
  Hash Table
&lt;/h2&gt;


&lt;div class="ltag_speakerdeck"&gt;
  &lt;iframe height="463" id="talk_frame_c85d5733295a4b7c92354268226bb646" src="//speakerdeck.com/player/c85d5733295a4b7c92354268226bb646" width="710"&gt;&lt;/iframe&gt;
&lt;/div&gt;


&lt;p&gt;&lt;a href="https://codepen.io/gitsushi/pen/NWNZpPa/right?editors=0012"&gt;Edit the Hash Table on Codepen&lt;/a&gt;&lt;/p&gt;

&lt;h2&gt;
  
  
  Tree
&lt;/h2&gt;


&lt;div class="ltag_speakerdeck"&gt;
  &lt;iframe height="463" id="talk_frame_7fe63086726e4352aaae4d1f21f07784" src="//speakerdeck.com/player/7fe63086726e4352aaae4d1f21f07784" width="710"&gt;&lt;/iframe&gt;
&lt;/div&gt;


&lt;h3&gt;
  
  
  Binary Tree
&lt;/h3&gt;


&lt;div class="ltag_speakerdeck"&gt;
  &lt;iframe height="463" id="talk_frame_78d0ff6de0724c52bc8e83864dc2eb70" src="//speakerdeck.com/player/78d0ff6de0724c52bc8e83864dc2eb70" width="710"&gt;&lt;/iframe&gt;
&lt;/div&gt;


&lt;p&gt;&lt;a href="https://codepen.io/gitsushi/pen/OJNemwq/right?editors=0012"&gt;Edit the Binary Tree on Codepen&lt;/a&gt;&lt;/p&gt;

&lt;h2&gt;
  
  
  Footnotes
&lt;/h2&gt;

&lt;ol&gt;
&lt;li&gt;&lt;a href="https://en.wikipedia.org/wiki/Node_(computer_science)"&gt;Wikipedia : Node&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href="https://en.wikipedia.org/wiki/Linked_list"&gt;Wikipedia : Linked List&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href="https://en.wikipedia.org/wiki/Binary_search_algorithm"&gt;Wikipedia : Binary Search&lt;/a&gt;&lt;/li&gt;
&lt;/ol&gt;

</description>
      <category>datastructure</category>
      <category>javascript</category>
    </item>
  </channel>
</rss>
