Reference no: EM133872602

Problem

Write a program that implements a binary search tree using a node-pointer implementation. Assume all entries in the tree will be unique. struct node { int data; node * left; node * right; }; Get the instant assignment help.

Requirements

Implement the following functions:

1. void insert(int data) // creates a new node and inserts it in the correct location in the tree

2. void print_preorder(node * root); // prints the data in a tree using a preorder traversal

3. void print_postorder(node * root); // prints the data in a tree using a postorder traversal

4. void print_inorder(node * root); // prints the data in a tree using an inorder traversal

5. int search(int data) // searches the tree for data. Returns 0 if data is not found, otherwise, returns the number of nodes visited MUST RUN IN O(logN) time!