/explore
|
You are here 
|
blog.notdot.net | ||
| | | | |
www.jeremykun.com
|
|
| | | | | This post comes in preparation for a post on decision trees (a specific type of tree used for classification in machine learning). While most mathematicians and programmers are familiar with trees, we have yet to discuss them on this blog. For completeness, well give a brief overview of the terminology and constructions associated with trees, and describe a few common algorithms on trees. We will assume the reader has read our first primer on graph theory, which is a light assumption. | |
| | | | |
markodenic.com
|
|
| | | | | Free programming books, algorithms, public APIs, and much more. | |
| | | | |
zietlow.io
|
|
| | | | | Basic data structure and algorithms implemented within go | |
| | | | |
imran-khan.com
|
|
| | | Binary Search Tree Today I wanted to talk about Binary Search Tree (BST). Basically, a binary search tree is a data structure used in computer science for organizing and storing data in a sorted manner. If you think of a tree, it has many branches. One branch leads to another branch, and that branch splits into others. The same concept applies to a binary search tree. In a BST, each node has at most two children, referred to as the left child and the right child. | ||
