Adjacency Lists and average time complexity for binary search (2 separate questions)
<p>Is the average time complexity for a successful binary search in a sorted array and in a binary search tree the same, <strong><em>O(log (n))</em></strong>?</p>

<p>Also, are the worst-case time complexity the same for both, <strong><em>O(n)</em></strong>?</p>

<hr>

<p>When drawing an adjacency list for a graph, does the order of this matter? For example, would it be wrong to change this:</p>

<p><a href="https://i.stack.imgur.com/8PQ2E.png" rel="nofollow noreferrer"><img src="https://i.stack.imgur.com/8PQ2E.png" alt="enter image description here"></a></p>

<p>To this (notice in the first row how the 2 and 3 are switched):</p>

<p><a href="https://i.stack.imgur.com/06f81.png" rel="nofollow noreferrer"><img src="https://i.stack.imgur.com/06f81.png" alt="enter image description here"></a></p>