Latest DATA STRUCTURE Aptitude Question SOLUTION: In binary search tree , n=nodes, h=height of tree. What's complexity? 1. o(h) 2. o(n*h) 3. o(nLogn) 4. o(n*n) 5. None

• Placement Papers
• /
• DATA STRUCTURE
• /
• Programming
• /
• Technical

DATA STRUCTURE Question Papers:

(#M40032002) DATA STRUCTURE Programming question C and Data structures Keep an EYE

In binary search tree , n=nodes, h=height of tree.

What's complexity?

1. o(h)

2. o(n*h)

3. o(nLogn)

4. o(n*n)

5. None

Asked In DATA STRUCTURE saranya sankar (10 years ago)

Unsolved Read Solution (9)

Is this Puzzle helpful?   (16)   (1) Submit Your Solution Technical