[go: up one dir, main page]
Scribd
Upload
8 views6 pages

DSA Assignment-4

Uploaded by

aryan.23bce8252
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
8 views6 pages

DSA Assignment-4

Uploaded by

aryan.23bce8252
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/ 6

DSA Assignment - 4

Thopireddy Aryan Reddy


23BCE8252

1Q. Write a program to implement Representa on of Binary tree


with linked list.
class Node {

int data;

Node left, right;

Node(int item) {

data = item;

left = right = null;

class BinaryTree {

Node root;

void insert(int data) {

root = insertRec(root, data);

Node insertRec(Node root, int data) {

if (root == null) {
ti
root = new Node(data);

return root;

if (data < root.data) {

root.left = insertRec(root.left, data);

} else if (data > root.data) {

root.right = insertRec(root.right, data);

return root;

void inorder() {

inorderRec(root);

void inorderRec(Node root) {

if (root != null) {

inorderRec(root.left);

System.out.print(root.data + " ");

inorderRec(root.right);

void preorder() {

preorderRec(root);

}
void preorderRec(Node root) {

if (root != null) {

System.out.print(root.data + " ");

preorderRec(root.left);

preorderRec(root.right);

void postorder() {

postorderRec(root);

void postorderRec(Node root) {

if (root != null) {

postorderRec(root.left);

postorderRec(root.right);

System.out.print(root.data + " ");

public static void main(String[] args) {

BinaryTree tree = new BinaryTree();

tree.insert(50);

tree.insert(30);

tree.insert(20);

tree.insert(40);

tree.insert(70);
tree.insert(60);

tree.insert(80);

System.out.println("Inorder traversal:");

tree.inorder();

System.out.println("\nPreorder traversal:");

tree.preorder();

System.out.println("\nPostorder traversal:");

tree.postorder();

2Q.Write a program to implement Binary tree


traversals- In-order, Pre-order, Post-order
using recursion.

class Node {

int data;

Node left, right;

Node(int item) {

data = item;

left = right = null;

}
class BinaryTree {

Node root;

void inorder(Node node) {

if (node != null) {

inorder(node.left);

System.out.print(node.data + " ");

inorder(node.right);

void preorder(Node node) {

if (node != null) {

System.out.print(node.data + " ");

preorder(node.left);

preorder(node.right);

void postorder(Node node) {

if (node != null) {

postorder(node.left);

postorder(node.right);

System.out.print(node.data + " ");

}
public static void main(String[] args) {

BinaryTree tree = new BinaryTree();

tree.root = new Node(1);

tree.root.left = new Node(2);

tree.root.right = new Node(3);

tree.root.left.left = new Node(4);

tree.root.left.right = new Node(5);

System.out.println("In-order traversal:");

tree.inorder(tree.root);

System.out.println("\nPre-order traversal:");

tree.preorder(tree.root);

System.out.println("\nPost-order traversal:");

tree.postorder(tree.root);

You might also like