Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<iostream>
- using namespace std;
- class Node{
- public:
- int data;
- Node *left,*right;
- Node(int key){
- data=key;
- left=right=NULL;
- }
- };
- void Print(Node* root,int first,int last){
- if(root==NULL)
- return;
- if(first<root->data)
- Print(root->left,first,last);
- if(root->data>=first && root->data<=last)
- cout<<" "<<root->data;
- if(root->data<last)
- Print(root->right,first,last);
- }
- void Insert(Node **root_ref,int key){
- if(*root_ref==NULL){
- *root_ref=new Node(key);
- return;
- }
- if((*root_ref)->data<key)
- Insert(&((*root_ref)->right),key);
- else
- if((*root_ref)->data>key)
- Insert(&((*root_ref)->left),key);
- }
- int main(){
- Node *root=NULL;
- Insert(&root,5);
- Insert(&root,7);
- Insert(&root,2);
- Insert(&root,8);
- int k1=0,k2=10;
- Print(root,k1,k2);
- return 0;
- }
Add Comment
Please, Sign In to add comment