Question

Binary tree please answer these two question properly about binary tree

Q(1) What are their respective logical and physical / storage structures .Q(2) At least one application example combining data structure and algorithm should be given.

Answer 1

1.

The logical structure of a binary includes 3 parts :

• Data part.
• Left child pointer.
• Right child pointer.

There are 2 ways to represent a binary tree in physical memory :

• Array representation.
• Linked representation.

2. An application which involves the binary tree data structure is displaying the list of all files inside a folder.

The algorithm in which the contents of a folder are displayed in postorder traversal is :

t = folder -> data;

Display( struct node folder )

{

Display(folder -> next);

Display(folder -> next);

if(folder -> data != t )

{

Display folder -> data;

}

}