Sign Up

Have an account? Sign In Now

Sign In

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here
Sign InSign Up

SIKSHAPATH

SIKSHAPATH Navigation

  • Home
  • Questions
  • Blog
    • Computer Science(CSE)
    • NPTEL
    • Startup
  • Shop
    • Internshala Answers
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Questions
  • Blog
    • Computer Science(CSE)
    • NPTEL
    • Startup
  • Shop
    • Internshala Answers
Home/Questions/Q 11859
Next
In Process
practice503
  • 0
practice503
Asked: February 23, 20222022-02-23T12:08:11+05:30 2022-02-23T12:08:11+05:30In: Data Structure

Compare the contrast between a binary and binary search tree.

  • 0

Compare the contrast between a binary and binary search tree.

assignmentdata structure and algorithm analysis
  • 1 1 Answer
  • 76 Views
  • 0 Followers
  • 0
Answer
Share
  • Facebook

    1 Answer

    • Voted
    • Oldest
    • Recent
    1. I'M ADMIN
      2022-02-23T21:05:55+05:30Added an answer on February 23, 2022 at 9:05 pm

      Binary Tree:

      • Tree where each node has up to two leaves, it’s a data structure.
      • It is a non-linear tree data structure where a node can have a maximum of 2 children.
      • Nodes with duplicate values are allowed.
      • Used to implement variations of Binary Tree like BST, Perfect Binary Tree, etc.
      • Time complexity is usually O(n)

       

      Binary Search Tree:

      • Used for searching. It’s an algorithm for searching element.
      • It is ordered binary tree with each node can have a maximum of 2 children.
      • In BST, the left child’s data will always have a value less than the parent’s data and the right child’s data will always have the value greater than the parent’s data
      • Nodes with duplicate values are not allowed.
      • Used to implement variations of Balanced Binary Trees like AVL, Red-Black, etc.
      • Time complexity is usually O(n)
      • 0
      • Reply
      • Share
        Share
        • Share on WhatsApp
        • Share on Facebook
        • Share on Twitter
        • Share on LinkedIn

    Leave an answer
    Cancel reply

    You must login to add an answer.

    Forgot Password?

    Need An Account, Sign Up Here

    Sidebar

    Stats

    • Questions 1k
    • Answers 1k
    • Posts 139
    • Best Answers 65
    • NPTEL Programming in Java Week 2 Assignment Answers 2023
    • (Solution Revealed) NPTEL Ethical Hacking Week 2 Assignment 2023
    • Probability and Statistics NPTEL Assignment answers – Week 1
    • NPTEL Joy of Computing Using Python Week 2 Assignment Answers 2023
    • NPTEL Problem Solving Through Programming In C Assignment 2 Answers 2023

    Popular Questions

    • I'M ADMIN

      Internshala ethical hacking final test answers: Question sequence differs but ...

      • 6 Answers
    • AK

      You have a green lottery ticket, with ints a, b, ...

      • 4 Answers
    • mj

      Solve by Gauss Elimination Method 5x+y+z+w=4 ,x+7y+z+w=12 , x+y+6z+w=-5, x+y+z+4w=-6

      • 3 Answers

    Explore

    • Recent Questions
    • Questions For You
    • Answers With Time
    • Most Visited
    • New Questions
    • Recent Questions With Time

    Footer

    Helpful Links

    • Contact
    • Disclaimer
    • Privacy Policy Notice
    • TERMS OF USE
    • FAQs
    • Refund/Cancellation Policy
    • Delivery Policy for Sikshapath

    Follow

    © 2021-2022 Sikshapath. All Rights Reserved

    Insert/edit link

    Enter the destination URL

    Or link to existing content

      No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.