Scribd
Upload
325 views

Trees Assignment Question

The document contains 8 questions asking about general trees and their representation, binary tree traversal techniques including preorder, inorder and postorder, Huffman coding with an example, constructing and traversing a binary search tree from a given sequence, building a binary tree from inorder and preorder traversals, non-recursive pseudo code for postorder tree traversal, non-recursive C++ code for any DFS traversal of a binary tree, and a function for deleting an element from a threaded binary search tree.

Uploaded by

Joe rogan
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
325 views

Trees Assignment Question

The document contains 8 questions asking about general trees and their representation, binary tree traversal techniques including preorder, inorder and postorder, Huffman coding with an example, constructing and traversing a binary search tree from a given sequence, building a binary tree from inorder and preorder traversals, non-recursive pseudo code for postorder tree traversal, non-recursive C++ code for any DFS traversal of a binary tree, and a function for deleting an element from a threaded binary search tree.

Uploaded by

Joe rogan
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Unit -2 TREES

Assignment Question

1. Explain the General Tree and describe its representation?

2. Explain various binary tree traversal techniques?

3. Discuss Huffman’s coding with an example?

4. Explain the concept of Binary Search Tree(BST)? Make a BST for the following
sequence of numbers 45,36,76,23,89,115,98,39,41,56,69,48.
Traverse the tree in Preorder, Inorder and Postorder.

5. Given the following Inorder and Preorder traversal use following sequence to
construct a binary tree:
Inorder sequence: D, G, B, H, E, A, F, I, C
Preorder sequence: A, B, D, G, E, H, C, F, I.

6. Write a non-recursive pseudo code for post order traversal of binary tree.

7. Write a non-recursive pseudo C++ code for any DFS traversal of binary tree.

8. Write a function for deletion of an element from threaded binary search tree.

You might also like