This preview shows page 1. Sign up to view the full content.
Unformatted text preview: 3d>What is a Priority queue? How does it differ from a regular queue?  3e>How do the interfaces between a stack and queue ADT differ?   4a>Describe the phenomenon of function overloading in C++  4b>How does it differ from function templates?  4c>Use function template to write code for an exchange function which exchanges data value in 2 placeholders.   5a>Define a Binary Search Tree  5b> What is lopsidedness in the context of a BST? How can you prevent it the context of deletion of a node?  5c> Write pseudo code for NodeSum (BT T) that will return the sum of the integer node contents of the nodes of a binary tree T.  5d> Write pseudo code for BTsrch (BT T, int x) that determines whether x is one of the entries of T. Note that T is not a BST.  5e> Write code for the same problem as in 5d> assuming T to be a BST  5f> Compare the efficiencies of the searches of 5d> and 5e>  ...
View Full Document
This note was uploaded on 02/16/2010 for the course COMPE 260 taught by Professor Lovegren during the Spring '10 term at San Diego State.
- Spring '10