1. Not finding help here? Sign up for a free 30min tutor trial with Chegg Tutors
    Dismiss Notice
Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

Data structures and algorithms: Priority queue as Binary Tree

Tags:
  1. Dec 25, 2015 #1
    1. The problem statement, all variables and given/known data
    Explain and compare two efficient implementations of a priority queue using binary tree.
    Ilustrate this on an example of ascending priority queue that is created when elements
    15, 38, 45, 21, 8, 55,20 are inserted and the two largest elements are deleted.
    2. Relevant equations
    3. The attempt at a solution

    Could someone give some guidance on this question?
    I don't need code, just an explanation.
     
    Last edited: Dec 25, 2015
  2. jcsd
  3. Dec 26, 2015 #2

    haruspex

    User Avatar
    Science Advisor
    Homework Helper
    Gold Member
    2016 Award

    Can you say what aspects you do not understand? Are you familiar with binary trees? How do you interpret 'priority' in the context of the example? What primitive functions do you think will need to be performed on the data structure?
     
Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook

Have something to add?
Draft saved Draft deleted



Similar Discussions: Data structures and algorithms: Priority queue as Binary Tree
  1. Binary trees (Replies: 1)

  2. Binary Search tree (Replies: 5)

Loading...