Thursday, 16 November 2017

Non-Linear Data Structure

What do you mean by non-linear data structure?
Data structure which is capable of expressing more complex relationship than that of physical adjacency is known as non-linear.

What do you mean by a tree in data structure?
A tree is a non-linear data structure, which represents hierarchical relationship between individual data elementss.

What do you mean by a child and parent of a tree in non-linear data structure?
The root (R) of each subtree is said to be a child of R and R is the parent of each subtree root.

What do you mean by a leaf node in tree data structure?
In a tree any node which has out degree zero(0) is known as leaf node.

What do you mean by a binary tree in data structure?
A Binary tree is a finite set of elements that is either empty or is partitioned into three disjoint subsets. The first subset contains a single element called the root of the tree. The other two subsets are called the left and right sub trees.

What are the different applications of binary tree in data structure?
a. Hierarchical database management system
b. File index schemes 

What do you mean by traversing in non-linear data structure like trees? 
Traversing a tree means processing it in such a way, that each node is visited only once.

What are the different types of traversing in non-linear data structure like trees? 
a. Pre-order traversal
b. In-order traversal
c. Post-order traversal

What are the different methods of binary tree implementation?
a. Linear implementation.
b. Linked implementation.


Thanks
Mukesh Rajput

No comments:

Post a Comment

Thanks
Mukesh Rajput