I'm not sure where to really start as this is a string:

Draw the tree that would be formed by inserting the words in this question into a binary search tree. Use lowercase letters.

Any ideas would be great!

Printable View

- 04-10-2012, 07:21 AMkraigballaBinary Search Trees
I'm not sure where to really start as this is a string:

Draw the tree that would be formed by inserting the words in this question into a binary search tree. Use lowercase letters.

Any ideas would be great! - 04-10-2012, 11:04 AMJosAHRe: Binary Search Trees
First implement a binary tree and an insert method that makes it a binary search tree, i.e. if a data element is smaller than a key in a node, it should end up in the left sub-tree; if it is larger it should be stored in the right sub-tree.

kind regards,

Jos - 04-10-2012, 05:31 PMkraigballaRe: Binary Search Trees
If I have two of the same words do I use both or just one?