•
•
•
•
What is DaniWeb IT Discussion Community?
You're currently browsing the C++ section within the Software Development category of DaniWeb, a massive community of 427,227 software developers, web developers, Internet marketers, and tech gurus who are all enthusiastic about making contacts, networking, and learning from each other. In fact, there are 2,224 IT professionals currently interacting right now! Registration is free, only takes a minute and lets you enjoy all of the interactive features of the site.
Please support our C++ advertiser: Programming Forums
Views: 181 | Replies: 1
![]() |
•
•
Join Date: Jul 2008
Posts: 1
Reputation:
Rep Power: 0
Solved Threads: 0
hi guys,
this is my first post here.
may be my question sound very silly and stupid to you....apology for that.
can anyone plz provide me the above algorithm :
1. c++ algorithm for finding the i th smallest element from a binary heap .
2. c++ algorithm to find the number of internal nodes of a binary search tree.
3. C++ algorithm to check whether a binary search tree is balanced or not.
its important for me to solve these problems.
if anyone has the solutions plz tell me.
this is my first post here.
may be my question sound very silly and stupid to you....apology for that.
can anyone plz provide me the above algorithm :
1. c++ algorithm for finding the i th smallest element from a binary heap .
2. c++ algorithm to find the number of internal nodes of a binary search tree.
3. C++ algorithm to check whether a binary search tree is balanced or not.
its important for me to solve these problems.
if anyone has the solutions plz tell me.
•
•
Join Date: Jan 2008
Posts: 1,776
Reputation:
Rep Power: 8
Solved Threads: 219
•
•
•
•
hi guys,
this is my first post here.
may be my question sound very silly and stupid to you....apology for that.
can anyone plz provide me the above algorithm :
1. c++ algorithm for finding the i th smallest element from a binary heap .
2. c++ algorithm to find the number of internal nodes of a binary search tree.
3. C++ algorithm to check whether a binary search tree is balanced or not.
its important for me to solve these problems.
if anyone has the solutions plz tell me.
Google is your friend, as well as Daniweb's and a dozen other programming forums' search engines. These are very common problems and come up all the time, so odds are that if you enter "binary search tree", "balanced binary search tree", "binary heap", etc., into Google, you'll get some links that will be exactly or at least close to what you are looking for, or at least enough to get you started. You can then make an attempt, and when you get stuck, which everyone does at first, come back here and ask a more detailed question and you'll get help.
![]() |
•
•
•
•
•
•
•
•
DaniWeb C++ Marketplace
•
•
•
•
Currently Active Users Viewing This Thread: 1 (0 members and 1 guests)
•
•
•
•
adsense adult advertising biometrics blogging book business coding community copyright cult of the dead cow data development earth engine europe forum google hacking image recognition internet search legal malware marketing mcafee microsoft monetization msn news pagerank photo privacy publishing ratings revenue search search engine security seo sex software spyware support technical video video search web webmaster wiki yahoo
- Previous Thread: losing decimal precision in division
- Next Thread: Dynamic 2d array of CString



Linear Mode