andre/30-seconds-of-code
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Update illustration paths

Browse Source
This commit is contained in:
Angelos Chalaris
2023-02-16 22:26:39 +02:00
parent da31e8d138
commit 739c152b2f
18 changed files with 18 additions and 19 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
blog_posts/js-data-structures-binary-search-tree.md
View File

@ -13,7 +13,7 @@ firstSeen: 2021-08-31T05:00:00-04:00
A binary search tree is a data structure consisting of a set of ordered linked nodes that represent a hierarchical tree structure. Each node is linked to others via parent-children relationship. Any given node can have at most two children (left and right). The first node in the binary search tree is the root, whereas nodes without any children are the leaves. The binary search tree is organized in such a way that for any given node, all nodes in its left subtree have a key less than itself and all nodes in its right subtree have a key greater than itself.
![JavaScript Binary Search Tree visualization](./blog_images/ds-binary-search-tree.png)
![JavaScript Binary Search Tree visualization](./illustrations/ds-binary-search-tree.png)
Each node in a binary search tree data structure must have the following properties: