## Discussion Forum

Que. | Which one of the following is the tightest upper bound that represents the time complexity of inserting an object into a binary search tree of n nodes? |

a. | O(n) |

b. | O(1) |

c. | O(log n) |

d. | O(n log n) |

Answer:O(log n) |

Que. | Which one of the following is the tightest upper bound that represents the time complexity of inserting an object into a binary search tree of n nodes? |

a. | O(n) |

b. | O(1) |

c. | O(log n) |

d. | O(n log n) |

Answer:O(log n) |

Questions from Previous year GATE question papers

UGC NET Previous year questions and practice sets

UGC NET Previous year questions and practice sets

Attempt a small test to analyze your preparation level. This GATE exam includes questions from previous year GATE papers.

Practice test for UGC NET Computer Science Paper. The questions asked in this NET practice paper are from various previous year papers.