img
All Q&A
1

What are the problems of binary tree?

Explain the improvement of performance by the use of height-balanced tree.

Explain how a height-balanced tree can be formed by inserting the following elements in the given order :

1, 2, 3, 4, 5, 6, 8, 9, 10, 7, 11

Show the root element the can be deleted from the above tree.

22 December, 2024
Height-balanced tree tree is a self-balancing binary tree also name is AVL Tree. For the tree to be considered balanced balance factor must be -1,0 or 1. Balance factor is height of the left subtree minus height of the right subtree of the specific node.
3

a) Write an algorithm for deletion of a node from a doubly-linked list. 

b) What is a threaded binary tree ? Write an algorithm for non-recursive in-order traversal of a threaded binary tree. 

22 December, 2024
Let the node to be deleted is del. 1) If node to be deleted is head node, then change the head pointer to next current head. 2) Set next of previous to del, if previous to del exixts. 3) Set prev of next to del, if next to del exixts.