Binary search code - StudentOfFortune.com

Question

Asked by:

kcrupper
Rating : No Rating
Questions Asked: 4
Tutorials Posted: 0

$5.00 Binary search code

From Computer-Science: Programming-Methods
Closed, but you can still post tutorials
Due on Feb. 13, 2009
Asked on Feb 10, 2009 at 5:30:10PM

Q:
Write a function to generate a N~node random binary search tree with distinct keys 1 through N. What is the running time of your routine? Must be in C++.

Attachments:

Available Tutorials to this Question

Posted by:

rainman
Rating (40): A+
Questions Asked: 2
Tutorials Posted: 174, earned $906.64

$12.00 C++ Program To Generate N-Node Binary Search Tree. Compiled, Tested, Works. Detailed Comments

This tutorial was purchased 7 times and rated A+ by students like you.
Posted on Feb 10, 2009 at 6:14:49PM

A:
Preview: ... > int value; Node* left; Node* right; }; Node::Node(int i) { value = i; left = NULL; right = NULL; } class BinaryTree { public: BinaryTree(); ~BinaryTree(); void insert(int i); //To clean up the memory after we're done void clear(); //Ways of displaying all of the keys in the tree starting at root void preorder(); void inorder(); void postorder(); //How many levels our tree is from the root int getLevels(); //Search to see if the tree contains a value bool findValue(int i); private: Node* root; //Ways of displaying all of the keys in the tree from node n void preorder(Node* n); void inorder(Node* n); void postorder(Node* n); //For clearing the tree void removeNode(Node*& n); //Private helper of insert, starts at private Node *root. void insert(Node*& n, int i); //How many levels our tree is from node n int levels(Node* n); //Search to see if the tree contains a value bool findValue(Node* n, int i); }; BinaryTree::BinaryTree() { root = NULL; } BinaryTree::~BinaryTree() { //Clean the tree up after we're done removeNode(root); } v ...

The full tutorial is about 1811 words long plus attachments.

Attachments:
bstree.cpp (6K)