Flashcards
Untitled
Cards in this deck (6)
- 1What is the worst-case running time for finding an element in a binary tree (not necessarily a binary search tree) of size n?O(n)
Consider the case that the binary tree is a linked list. - 2What is the worst case running time for finding an element in a binary search tree(not necessarily balanced) of size n?O(n)
Consider the case that the binary search tree is a linked list. - 3Which of the following shows the order of node visit in a Breadth-first Search?A
Breadth-first Search visits nodes level by level which is shown in A. Figure B shows the order of node visits in a Depth-first Search. - 4What data structure does Breadth-first search typically uses to store intermediate states?Queue
Breadth-first search uses a queue and Depth-first search uses a stack. - 5What is the best way of checking if an element exists in a sorted array once in terms of time complexity? Select the best that applies.Binary Search
- 6—
Information
- Description
- 1 Algorithms & Techniques Flashcards on Untitled, created by Tyler Terry on 29/01/2023.
- Created by
- Tyler Terry
- Views
- 0
- Rating