1. For each (f, g) functions below, is f(n) = O(g(n)) or g(n) = O(f(n)) or...

Transcribed Image Text:

1. For each (f, g) functions below, is f(n) = O(g(n)) or g(n) = O(f(n)) or both? • f(n) = log₂ (n), g(n) = log, (n) • f(n) = 2", g(n) = 3″ • f(n)= 50, g(n) = log10 (n) 2. Find the DFS traversal and BFS traversal of the following binary tree. What are the time complexities of the traversals? Parent-- Child Siblings 5 Root Node Interior Nodes 10 Leaf Nodes 1. For each (f, g) functions below, is f(n) = O(g(n)) or g(n) = O(f(n)) or both? • f(n) = log₂ (n), g(n) = log, (n) • f(n) = 2", g(n) = 3″ • f(n)= 50, g(n) = log10 (n) 2. Find the DFS traversal and BFS traversal of the following binary tree. What are the time complexities of the traversals? Parent-- Child Siblings 5 Root Node Interior Nodes 10 Leaf Nodes

Answer rating: 100% (QA)

fn Log n gn log n for Big Oh 10 notection changing the ... View the full answer