|
-
November 20th, 2002, 06:21 PM
#1
Senior Member
Binary tree
Can you help me with the binary tree,,,,,,,,,, Please explain me in the technical terms, how does it searches.
-
November 20th, 2002, 06:27 PM
#2
Found a very simple definition here:
http://searchdatabase.techtarget.com...509290,00.html
For others a google search for "Binary Trees" brought up a number of sites (hint hint).
SodaMoca5
\"We are pressing through the sphincter of assholiness\"
-
November 20th, 2002, 06:42 PM
#3
Yes, you can get all you need for a definition by searching google. :-)
My definition (over-simplified) is that a binary (search) tree is a better data structure (non-linear) for searching really large amounts of information. It's much faster than, say, searching an array (linear data structure). In a binary tree, beginnning at the root node, each node has a pointer that can point to two other nodes - child nodes...ahhh it's a little involved to explain here, but not a difficult concept.
What is it that you are doing?? Do you have a book? Just curious.
Posting Permissions
- You may not post new threads
- You may not post replies
- You may not post attachments
- You may not edit your posts
-
Forum Rules
|
|