what the uniqeness of a binary search tree..

[transgalactic2]

how to describe a binary search tree?

[QuantumPete]

Ooooh, I was going to do my www.googleityourself.com thing, but actually in this case it's more of a www.whydon'tyousearchwikipedia.com

Properties of a BST.

QuantumPete

[transgalactic2]

on the right is bigger then root
on the left its smaller then root

thats it?

[QuantumPete]

Ok, let me quote directly from the page then:

In computer science, a binary search tree (BST) is a binary tree data structure which has the following properties:

* each node (item in the tree) has a value;
* a total order (linear order) is defined on these values;
* the left subtree of a node contains only values less than the node's value;
* the right subtree of a node contains only values greater than or equal to the node's value.

I should add to that definition that each node has at most 2 children.

QuantumPete

[zacs7]

> I should add to that definition that each node has at most 2 children.
It's a given, but it couldn't hurt

[transgalactic2]

thanks

[QuantumPete]

> I should add to that definition that each node has at most 2 children.
It's a given, but it couldn't hurt

That's what puts "binary" into BST

QuantumPete