Binary Search Tree: big o

Author: imteekay

README.md

@@ -23,7 +23,7 @@
 - Queue: Implementation [Here](https://github.com/LeandroTk/algorithms/blob/master/computer_science/data_structures/queue/queue.py) & Big O Complexity [Here](https://github.com/LeandroTk/algorithms/blob/master/computer_science/data_structures/queue/big_o.py)
 - Linked List: Implementation [Here](https://github.com/LeandroTk/algorithms/blob/master/computer_science/data_structures/linked_list/linked_list.py) & Big O Complexity [Here](https://github.com/LeandroTk/algorithms/blob/master/computer_science/data_structures/linked_list/big_o.py)
 - Binary Tree: Implementation [Here](https://github.com/LeandroTk/algorithms/blob/master/computer_science/data_structures/binary_tree/binary_tree.py) & Big O Complexity [Here](https://github.com/LeandroTk/algorithms/blob/master/computer_science/data_structures/binary_tree/big_o.py)
-- Binary Search Tree: Implementation [Here](https://github.com/LeandroTk/algorithms/blob/master/computer_science/data_structures/binary_search_tree/binary_search_tree.py)
+- Binary Search Tree: Implementation [Here](https://github.com/LeandroTk/algorithms/blob/master/computer_science/data_structures/binary_search_tree/binary_search_tree.py) & Big O Complexity [Here](https://github.com/LeandroTk/algorithms/blob/master/computer_science/data_structures/binary_search_tree/big_o.py)
 - Binary Search Tree Without Node class: Implementation [Here](https://github.com/LeandroTk/algorithms/blob/master/computer_science/data_structures/binary_search_tree_without_node/binary_search_tree.py)
 
 # Competitive Programming Websites

computer_science/data_structures/binary_search_tree/big_o.py

@@ -0,0 +1,3 @@
+# insert: O(log(N)) - Logarithmic Time
+# find / search: O(log(N)) - Logarithmic Time
+# traversal: O(N) - Linear Time