From 31143251135afd11db0d92f088da91b64544877e Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?W=C3=A8i=20C=C5=8Dngru=C3=AC?= <crvv.mail@gmail.com>
Date: Mon, 18 Mar 2019 18:13:17 +0800
Subject: [PATCH] remove access time complexity for trees and abstract data
 types

---
 Tables.html | 14 +++++++-------
 1 file changed, 7 insertions(+), 7 deletions(-)

diff --git a/Tables.html b/Tables.html
index 2322456..1a604ab 100644
--- a/Tables.html
+++ b/Tables.html
@@ -39,7 +39,7 @@ <h2 id="data-structures">Common Data Structure Operations</h2>
     </tr>
     <tr>
       <td><a href="http://en.wikipedia.org/wiki/Stack_(abstract_data_type)">Stack</a></td>
-      <td><code class="yellow">&Theta;(n)</code></td>
+      <td><code class="yellow">N/A</code></td>
       <td><code class="yellow">&Theta;(n)</code></td>
       <td><code class="green">&Theta;(1)</code></td>
       <td><code class="green">&Theta;(1)</code></td>
@@ -51,7 +51,7 @@ <h2 id="data-structures">Common Data Structure Operations</h2>
     </tr>
     <tr>
       <td><a href="http://en.wikipedia.org/wiki/Queue_(abstract_data_type)">Queue</a></td>
-      <td><code class="yellow">&Theta;(n)</code></td>
+      <td><code class="yellow">N/A</code></td>
       <td><code class="yellow">&Theta;(n)</code></td>
       <td><code class="green">&Theta;(1)</code></td>
       <td><code class="green">&Theta;(1)</code></td>
@@ -111,7 +111,7 @@ <h2 id="data-structures">Common Data Structure Operations</h2>
     </tr>
     <tr>
       <td><a href="http://en.wikipedia.org/wiki/Binary_search_tree">Binary Search Tree</a></td>
-      <td><code class="yellow-green">&Theta;(log(n))</code></td>
+      <td><code class="yellow-green">N/A</code></td>
       <td><code class="yellow-green">&Theta;(log(n))</code></td>
       <td><code class="yellow-green">&Theta;(log(n))</code></td>
       <td><code class="yellow-green">&Theta;(log(n))</code></td>
@@ -135,7 +135,7 @@ <h2 id="data-structures">Common Data Structure Operations</h2>
     </tr>
     <tr>
       <td><a href="http://en.wikipedia.org/wiki/B_tree">B-Tree</a></td>
-      <td><code class="yellow-green">&Theta;(log(n))</code></td>
+      <td><code class="yellow-green">N/A</code></td>
       <td><code class="yellow-green">&Theta;(log(n))</code></td>
       <td><code class="yellow-green">&Theta;(log(n))</code></td>
       <td><code class="yellow-green">O(log(n))</code></td>
@@ -147,7 +147,7 @@ <h2 id="data-structures">Common Data Structure Operations</h2>
     </tr>
     <tr>
       <td><a href="http://en.wikipedia.org/wiki/Red-black_tree">Red-Black Tree</a></td>
-      <td><code class="yellow-green">&Theta;(log(n))</code></td>
+      <td><code class="yellow-green">N/A</code></td>
       <td><code class="yellow-green">&Theta;(log(n))</code></td>
       <td><code class="yellow-green">&Theta;(log(n))</code></td>
       <td><code class="yellow-green">&Theta;(log(n))</code></td>
@@ -171,7 +171,7 @@ <h2 id="data-structures">Common Data Structure Operations</h2>
     </tr>
     <tr>
       <td><a href="http://en.wikipedia.org/wiki/AVL_tree">AVL Tree</a></td>
-      <td><code class="yellow-green">&Theta;(log(n))</code></td>
+      <td><code class="yellow-green">N/A</code></td>
       <td><code class="yellow-green">&Theta;(log(n))</code></td>
       <td><code class="yellow-green">&Theta;(log(n))</code></td>
       <td><code class="yellow-green">&Theta;(log(n))</code></td>
@@ -183,7 +183,7 @@ <h2 id="data-structures">Common Data Structure Operations</h2>
     </tr>
     <tr>
       <td><a href="http://en.wikipedia.org/wiki/K-d_tree">KD Tree</a></td>
-      <td><code class="yellow-green">&Theta;(log(n))</code></td>
+      <td><code class="yellow-green">N/A</code></td>
       <td><code class="yellow-green">&Theta;(log(n))</code></td>
       <td><code class="yellow-green">&Theta;(log(n))</code></td>
       <td><code class="yellow-green">&Theta;(log(n))</code></td>