<h1 id="stacks-and-queues"><a aria-hidden="true" class="anchor-heading" href="#stacks-and-queues"><svg aria-hidden="true" viewBox="0 0 16 16"><use xlink:href="#svg-link"></use></svg></a>Stacks and Queues</h1>
<h2 id="linear-data-structures"><a aria-hidden="true" class="anchor-heading" href="#linear-data-structures"><svg aria-hidden="true" viewBox="0 0 16 16"><use xlink:href="#svg-link"></use></svg></a>Linear Data Structures</h2>
<p>Stacks and Queues are linear data structures.</p>
<h2 id="to-do"><a aria-hidden="true" class="anchor-heading" href="#to-do"><svg aria-hidden="true" viewBox="0 0 16 16"><use xlink:href="#svg-link"></use></svg></a>To Do</h2>
<ul class="contains-task-list">
<li class="task-list-item"><input type="checkbox" disabled> Min Max Stack construction</li>
<li class="task-list-item"><input type="checkbox" disabled> balanced brackets</li>
<li class="task-list-item"><input type="checkbox" disabled> sunset views</li>
<li class="task-list-item"><input type="checkbox" disabled> sort stack</li>
<li class="task-list-item"><input type="checkbox" disabled> next greater element</li>
<li class="task-list-item"><input type="checkbox" disabled> shorten path</li>
<li class="task-list-item"><input type="checkbox" disabled> largest rectangle under skyline</li>
</ul>
<hr>
<h2 id="children"><a aria-hidden="true" class="anchor-heading" href="#children"><svg aria-hidden="true" viewBox="0 0 16 16"><use xlink:href="#svg-link"></use></svg></a>Children</h2>
<ol>
<li><a href="/Dendron/notes/uLbeeEPOK6aYy7t8qQYFB">balanced-brackets</a></li>
<li><a href="/Dendron/notes/cs1rep96HogEwddBbZ1al">decompress</a></li>
<li><a href="/Dendron/notes/RrG5ujLHBbCFiqM3qCxVI">paired-parentheses</a></li>
</ol>

Stacks and Queues


# Computer Science Library

This is a collection of notes ranging from data structures and problems to specific knowledge of a programming language. It is a stored knowledge of different programming languages and applications for easy retrieval and note keeping.

This repository will be continually updated and maintained as knowledge base grows and aspects of languages are updated.

![](/assets/images/2022-01-02-23-34-36.png)
