Scribd
Upload
33 views

Practice Assignment - 5 Tree

This document contains 8 practice problems about various tree data structures: 1. List the node visit sequence for preorder, postorder, and breadth first traversals of a sample tree. 2. Convert a polynomial expression to a tree and postfix notation. 3. Convert infix expressions to postfix using binary tree traversal. 4. Evaluate postfix expressions of single digit numbers and operators.

Uploaded by

Anonymous Only
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
33 views

Practice Assignment - 5 Tree

This document contains 8 practice problems about various tree data structures: 1. List the node visit sequence for preorder, postorder, and breadth first traversals of a sample tree. 2. Convert a polynomial expression to a tree and postfix notation. 3. Convert infix expressions to postfix using binary tree traversal. 4. Evaluate postfix expressions of single digit numbers and operators.

Uploaded by

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

Practice Assignment-5: TREE Data Structure

1. What is the sequence of nodes visited for the following tree for a preorder, postorder,
and breadth first traversal ?

2. Consider the polynomial


3𝑥 2 + 7𝑥 − 6

(a) Write the polynomial as an expression tree that obeys the usual ordering
of operations. Hint: to clarify the ordering for yourself, first write the
expression with brackets indicating the order of operations.
(b) Write the polynomial as postfix expression.

3. Convert the following infix expressions to postfix expressions using binary tree
traversal.

4. Evaluate the following postfix expressions made out of single digit numbers and the
usual integer operators.
5. Prove by induction that an in-order traversal of a binary search tree visits the nodes in
order defined by the keys.
Hint: What is the base case? what is the variable used for the proposition? The number
of nodes of the tree? Something else? What is the induction step?

6. Draw the structure of a binary min-heap after these priorities have been inserted:
10, 12, 1, 14, 6, 5, 8, 15, 3, 9, 7, 4, 11, 13, 2
Also draw the structure after three deleteMin operations.

A file contains only spaces and digits in the following frequency:


space (9), a (5), b (1), d (3), e (7), f (3), h (1), i (1), k (1), n (4), o (1), r (5), s (1), t (2), u
(1), v (1).
Construct the Huffman code.

7. Show the result of inserting


28, 12, 17, 4, 31, 34, 8, 14, 16
in that order into an initially empty B-Tree with M = 3.

8. Consider the following AVL Tree:

(a) Draw the resulting BST after 5 is removed, but before any rebalancing takes place.
Label each node in the resulting tree with its balance factor. Replace a node with
both children using an appropriate value from the node's left child.

(b) Now rebalance the tree that results from (a). Draw a new tree for each rotation
that occurs when rebalancing the AVL Tree (you only need to draw one tree that
results from an RL or LR rotation). You do not need to label these trees with
balance factors.

You might also like