BST Readme

Author: ji-sang-geun

C++/Data-Structures/BST/readme.md

@@ -0,0 +1,30 @@
+### BST
+- [BST Implementation](BST_implementation.cpp)
+
+ The BST implementation algorithm is to create the BST structure. Repeat inserting data smaller than the parent node on the left, relative to the parent node, larger than the parent node on the right. 
+ 
+ Time complexity = O(h)
+
+- [Check BST](check_bst.cpp)
+
+ The BST check algorithm verifies that BST is normally generated. Output False if root is null and True if not null. 
+ 
+ Time complexity = O(n)
+
+- [Constructing BST from Level Order Traversal](Constructing%20BST%20from%20Level%20Order%20Traversal.cpp)
+
+ The Constructing BST from Level Order Traversal algorithm explores BST with the Level Order Traversal method. The methods of navigation include pre-order, inorder, postorder, and level order. 
+ 
+ Time complexity = O(n^2)
+
+- [Deletion From A BST](Deletion%20From%20A%20BST.cpp)
+
+ The Delete From A BST algorithm deletes a specific node that exists in BST. The number of cases in which a node is deleted is divided into the absence of a child, the existence of only the left child, the existence of only the right child, or both. 
+ 
+ Time complexity = O(n) 
+
+- [Pair Sum In BST](pair_sum_in_bst.cpp)
+
+ The pair_sum_in_bst algorithm adds the sum of both in search of when both child nodes exist. 
+ 
+ Time complexity = O(n)