-
- [ ] ? [2406. Divide Intervals Into Minimum Number of G](https://leetcode.com/problems/divide-intervals-into-minimum-number-of-groups/?envType=daily-question&envId=2024-10-12)
- [x] ๐จ ๐[200. Number โฆ
-
## insertion.js
``` js
const T = {};
const elements = [5, 8, 10, 3, 1, 6, 9, 7, 2, 0, 4];
function bstInsert(root, element) {
if(element < root) {
if(T[root]['left']) {
โฆ
-
- child node๋ฅผ ์ต๋ 2๊ฐ ๊ฐ๋ ๊ณ์ธต์ ๊ตฌ์กฐ
- ํน์ฑ
- ์ด๋ค node์ ์ข์ธก child node์ ๋ชจ๋ ๊ฐ์ด ๋ ์๊ณ ,
- ์ด๋ค node์ ์ฐ์ธก child node์ ๋ชจ๋ ๊ฐ์ด ๋ ํผ.
- ์ฆ, ์์๊ฐ ํฌ๊ธฐ๋ณ๋ก ์ ๋ ฌ๋์๋ค๊ณ ํ ์ ์๋ค.
- ๊ทธ๋์ ์ ์ฌ์ฉํ๋์ง?
- insert, erase, find, update๊ฐ ์ โฆ
-
Requesting to do a BST
-
Implementation of Binary Search Tree and Performing Basic Operations such as Insertion, Deletion and Searching.
-
[Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree/)
-
๐ ์คํฐ๋ ๋ ์ง : 2023๋
2์ 1์ผ
-
## Description ๐
I want to provide Documentation on BST , traversal and additional codes
## Domain of Contribution ๐
- [x] Competitive Programming
-
implement binary search in C++, Java, python, or in any other language
-