Sign In
Create Account
Follow Us on Twitter
Subscribe on Youtube
1
Hello,
im confused, how we starting when we have an orded array and we want to represent it in binary tree?
Example : Array(A):{1,2,3,4,5,6,7,8,9}
Starting from first element, or from middle?
1 reply to this topic
#1
Posted 23 May 2011 - 10:27 AM
toto_7
-
- Members
-
- 295 posts
Programming Professional
"Programming is like sex. One mistake and you have to support it for the rest of your life."
-Michael Sinz
Back to top|
|
|
#2
Posted 23 May 2011 - 01:31 PM
WingedPanther
-
- Moderators
-
- 16,831 posts
A spammer's worst nightmare
- Location:Upstate, South Carolina
- Programming Language:C, C++, PL/SQL, Delphi/Object Pascal, Pascal, Transact-SQL, Others
- Learning:Java, C#, PHP, JavaScript, Lisp, Fortran, Haskell, Others
It depends on what type of encoding you want to use. Does it matter if the tree is balanced? Do you intend to recurse the tree using depth first search or breadth first search?
1 user(s) are reading this topic
0 members, 1 guests, 0 anonymous users
