BST implementation of priority queues

This is a discussion on BST implementation of priority queues within the C Programming forums, part of the General Programming Boards category; can anyone help me wif the topic above? any data structures that is used? thanks mate...

  1. 05-14-2002 #1
    jcleong
    jcleong is offline
    Registered User
    Join Date
    May 2002
    Posts
    1

    BST implementation of priority queues

    can anyone help me wif the topic above? any data structures that is used?
    thanks mate
  2. 05-14-2002 #2
    Prelude
    Prelude is offline
    Code Goddess Prelude's Avatar
    Join Date
    Sep 2001
    Posts
    9,805
    >BST implementation of priority queues
    >any data structures that is used?
    Um...a BST perhaps? You answered your own question. To be more specific, why don't you do some research on heaps. They are excellent tree based data structures for a priority queue.

    -Prelude
    My best code is written with the delete key.
« Previous Thread | Next Thread »
Popular pages Recent additions subscribe to a feed

Similar Threads

  1. priority inversion due to pthread_mutex_lock(): how to avoid?
    By mynickmynick in forum C Programming
    Replies: 11
    Last Post: 04-07-2009, 10:34 AM
  2. crazy pipe/fork
    By fortune2k in forum C Programming
    Replies: 8
    Last Post: 03-13-2009, 11:28 AM
  3. Priority Queue Help
    By cjwenigma in forum C++ Programming
    Replies: 6
    Last Post: 11-14-2007, 11:48 PM
  4. priority list won't work, i give up
    By teamster in forum C Programming
    Replies: 8
    Last Post: 10-19-2006, 12:26 PM
  5. Priority queue's
    By Cmuppet in forum C Programming
    Replies: 7
    Last Post: 11-23-2004, 01:21 PM

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21