By using this site, you agree to our updated Privacy Policy and our Terms of Use. Manage your Cookies Settings.
424,946 Members | 717 Online
Bytes IT Community
+ Ask a Question
Need help? Post your question and get tips & solutions from a community of 424,946 IT Pros & Developers. It's quick & easy.

binary tree implementation and methods

P: 2
i need the function thet check if a tree is an almost complete binery tree,
the tree is not sorted so i cant use an arry
please help me......
Jun 20 '07 #1
Share this Question
Share on Google+
3 Replies

Expert Mod 5K+
P: 9,197
What do you mean by an almost complete binary tree?? I haven't heard that before.
Jun 21 '07 #2

P: 2
almost complete binary tree:
All leafs at lowest and next-tolowest
levels only.
All except the lowest level is
No gaps except at the end of a
A perfectly balanced tree with
leaves at the last level all in the
leftmost position.
A tree which can be represented
without any vacant space in the
array representation.
but my tree cant be represented with array becausr it is not sorted
please help me....
Jun 21 '07 #3

Expert Mod 2.5K+
P: 4,677

Please have a look at our Posting Guidelines, which request (among other things) that you use good thread titles, and show that you have attempted the problem, as we are not allowed (nor do most here want) to do your work for you.

So, what have you tried, or what part of the implementation are you getting stuck on? Have you researched binary trees, and are aware of their properties?
Jun 21 '07 #4

Post your reply

Sign in to post your reply or Sign up for a free account.