Non-Linear Data Structure

What do you mean by non-linear data structure?
The 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 the data structure?
A tree is a non-linear data structure, which represents the hierarchical relationship between individual data elements.

What do you mean by a child and parent of a tree in the 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 the leaf node.

What do you mean by a binary tree in the data structure?
A Binary tree is a finite set of elements that are 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 subtrees.

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

What do you mean by traversing in a 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 a 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
Mukesh Rajput

Mukesh Rajput

I am a Computer Engineer, a small amount of the programming tips as it’s my hobby, I love to travel and meet people so little about travel, a fashion lover and love to eat food, I am investing a good time to keep the body fit so little about fitness also..

Post A Comment:

0 comments:

Thanks
Mukesh Rajput