Scribd
Upload
36 views2 pages

Tree2 Implementation of Binary Tree Using Linked List

This C++ program implements a binary tree using linked lists. It defines a Node class with left and right pointers and an integer data field. A makeTree function recursively builds the tree by prompting the user for node values and left and right children. Preorder, inorder, and postorder traversal functions output the tree values using these ordering schemes. The main function calls makeTree to build the tree and then calls each traversal type to output the results.

Uploaded by

Shivam Thakur
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
36 views2 pages

Tree2 Implementation of Binary Tree Using Linked List

This C++ program implements a binary tree using linked lists. It defines a Node class with left and right pointers and an integer data field. A makeTree function recursively builds the tree by prompting the user for node values and left and right children. Preorder, inorder, and postorder traversal functions output the tree values using these ordering schemes. The main function calls makeTree to build the tree and then calls each traversal type to output the results.

Uploaded by

Shivam Thakur
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

//Implementation of Binary Tree Using Linked List

#include<iostream>

using namespace std;

class Node{
public:
Node *left,*right;
int data;

public:
Node(){
left=right=NULL;
data=0;
}

Node(int data){
this->data = data;
left=right=NULL;
}
};

Node *makeTree(){

int data;
cout<<"\nEnter Value of Node : (-1 for No Node) : ";
cin>>data;

if(data==-1){
return NULL;
}

Node *newNode = new Node();


newNode->data = data;

cout<<"\nEnter Left Child of : "<<newNode->data;


newNode->left = makeTree();

cout<<"\nEnter Right Child of : "<<newNode->data;


newNode->right = makeTree();

return newNode;
}

void preorder(Node *root){


if(root==NULL)
return;

cout<<root->data<<" ";
preorder(root->left);
preorder(root->right);
}

void inorder(Node *root){


if(root==NULL)
return;

inorder(root->left);
cout<<root->data<<" ";
inorder(root->right);
}

void postorder(Node *root){


if(root==NULL)
return;

postorder(root->left);
postorder(root->right);
cout<<root->data<<" ";
}

int main(){

Node *root = makeTree();

cout<<"\nPreorder Traversal is : ";


preorder(root);

cout<<"\nInorder Traversal is : ";


inorder(root);

cout<<"\nPostOrder Traversal is :";


postorder(root);

return 0;
}

You might also like