<h1 id="binary-search-trees"><a aria-hidden="true" class="anchor-heading" href="#binary-search-trees"><svg aria-hidden="true" viewBox="0 0 16 16"><use xlink:href="#svg-link"></use></svg></a>Binary Search Trees</h1>
<h2 id="binary-search-tree-problems-to-do"><a aria-hidden="true" class="anchor-heading" href="#binary-search-tree-problems-to-do"><svg aria-hidden="true" viewBox="0 0 16 16"><use xlink:href="#svg-link"></use></svg></a>Binary Search Tree Problems To Do</h2>
<ul class="contains-task-list">
<li>[ ]</li>
<li class="task-list-item"><input type="checkbox" disabled> BST Construction</li>
<li class="task-list-item"><input type="checkbox" disabled> Validate BST</li>
<li class="task-list-item"><input type="checkbox" disabled> BST Traversal</li>
<li class="task-list-item"><input type="checkbox" disabled> Min Height BST</li>
<li class="task-list-item"><input type="checkbox" disabled> Find Kth Largest Value in BST</li>
<li class="task-list-item"><input type="checkbox" disabled> Reconstruct BST</li>
<li class="task-list-item"><input type="checkbox" disabled> Same BST</li>
<li class="task-list-item"><input type="checkbox" disabled> Validate Three Nodes</li>
<li class="task-list-item"><input type="checkbox" disabled> MRight Smaller Than</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/VWz2l3mWLt6icKBj8zwbs">find-closest-value-in-bst</a></li>
</ol>

Binary Search Trees


# 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)
