Scribd
Upload
3 views1 page

DS Assign 6

Uploaded by

Hatim Habib
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
3 views1 page

DS Assign 6

Uploaded by

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

Assignment No.

6 Topic: Binary Tree and Binary Search Tree operations

Roll_no Mod 10 Last date as 12th Nov. 2022

Roll Problem Definition


No.
1 Write a menu driven program to create a Binary Tree and perform following non-recursive operations on it.
1. Preorder traversal, 2. Display mirror image of a tree without creating new tree, 3. Display height of a
tree.
2 Write a menu driven program to create a Binary Tree and perform following non-recursive operations on it.
1. Postorder Traversal, 2. Display a tree levelwise, 3. Display leaf nodes of a tree.
3 Write a menu driven program to create a Binary Tree and perform following non-recursive operations on it.
1. Inorder Traversal, 2. Display mirror image of a tree by creating new tree, 3. Equality of two trees.
4 Write a menu driven program to create a Binary Tree and perform following non-recursive operations on it.
1. Postorder Traversal, 2. Preorder Traversal, 3. Inorder Traversal, 4.Copy a tree.
5 Write a menu driven program to create a Binary Search Tree and perform following non-recursive operations
on it.
1. Preorder traversal, 2. Display mirror image of a tree without creating new tree, 3. Display height of a
tree.
6 Write a menu driven program to create a Binary Search Tree and perform following non-recursive operations
on it.
1. Postorder Traversal, 2. Display a tree levelwise, 3. Display leaf nodes of a tree.
7 Write a menu driven program to create a Binary Search Tree and perform following non-recursive operations
on it.
1. Inorder Traversal, 2. Display mirror image of a tree by creating new tree, 3. Delete a node from a tree.
8 Write a menu driven program to create a Binary Search Tree and perform following non-recursive operations
on it.
1. Postorder Traversal, 2. Preorder Traversal, 3. Inorder Traversal, 4.Copy a tree.
9 Write a menu driven program to create a Binary Search Tree and perform following non-recursive operations
on it.
1. Copy a tree, 2. Equality of two trees, 3. Delete a node from a tree.
10 Write a menu driven program to create a Binary Search Tree and perform following non-recursive operations
on it.
1. Insert a node in a tree, 2. Display the height of the tree, 3. Delete a node from a tree.

You might also like