Generic selectors
Exact matches only
Search in title
Search in content
Post Type Selectors

Net 12

Photo of author

By Team EasyExamNotes

CBSE NET DECEMBER 2007 PAPER II

The height of a binary tree with ‘n’ nodes in the worst case is 

(A)  0(log n)
(B)  O(n)
(C)  Ω(n log n)
(D)  Ω(n2)

Ans:- B

Explanation:-
Big omega notation is used for representing the average case. Big oh notation is used for representing the worst case. Big oh is a measure of the longest amount of time it could possibly take for any algorithm to complete. Since we are representing the height of a binary tree, it would be the maximum height possible in a tree with ‘n’ nodes and it is O(n). So, the correct answer is B.

Download as PDF

Related posts:

  1. Net 42
  2. Net 14
  3. Net 13
  4. Net 35
  5. Net 32
  6. Net 29
  7. Net 27
  8. Net 52
  9. Net 51
  10. Net 45
  11. Net 41
  12. Net 38
  13. Net 37
  14. Net 36
  15. CBSE NET 2004 38
  16. Cbse net 2004 37
  17. Cbse net 2004
  18. CBSE Net 2017
  19. Ugc net 2017 solved
  20. Net 11
  21. Net 10
  22. Net 9
  23. Net 9
  24. Net 8
  25. Net 7
  26. Net 6
  27. Net 5
  28. NET 4
  29. NET 3
  30. NET 1
  31. NET 2
  32. Net 34
  33. Net 33
  34. Net 31
  35. Net 30
  36. Net 28
  37. Net 26
  38. Net 50
  39. Net 49
  40. Net 48
  41. Net 47
  42. Net 46
  43. Net 44
  44. Net 43
  45. Net 40
  46. Net 39
  47. UGC NET November 2017 Paper II
  48. GATE CS | Binary tree questions | Prof. Jayesh Umre
  49. GATE | Binary Search Tree | Related Questions | Prof. Jayesh Umre
  50. GATE 2004, Calculate height of Binary Tree | Prof. Jayesh Umre
  51. GATE 2010 Binary tree descendent | Prof. Jayesh Umre
  52. UGC NET CS Paper 2 June 2012
  53. Readers Writes Problem | UGC NET Dec 2018
  54. Suppose a system has 12 instances | UGC NET Dec 2018
  55. Data warehouse | UGC NET Dec 2018
  56. Linked List in Data Structure
  57. Array in Data Structure
  58. Traversal operation on array
  59. Insertion Operation on Array
  60. Data Structures: Definition, Importance, Applications and types
  61. Concepts of Data and Information

Leave a Comment