general tree vs binary tree feature img

Difference Between Tree And Binary Tree In Hindi. General tree और binary tree में अंतर हिंदी में |

हेलो दोस्तों, आज के इस blog post में मैं आपको binary Tree और एक General Tree में अंतर बताने जा रहा हूँ, जिसको ले कर बहुत से लोग confuse रहते है | जिन्होंने Data structure subject को पढ़ा होगा उन्हें Tree और binary Tree के बारे जरूर कुछ न कुछ पता होगा, पर यदि आपने

merge sort feature

Merge Sort In Data Structure.

Hello Friends, In this blog post I am going to let you know about a very important sorting technique in data structure that is Merge Sort. Merging is the process of combining two or more sorted files into a third sorted file. Let ‘A’ be a sorted list containing ‘X’ number of elements and ‘B’

selection sort feature

Selection Sort In Hindi In Data Structure.

हेलो friends , आज के blog post में मैं आपको Selection sort के बारे में बताने वाला हूँ| Selection sort में हम दिए गए element को sort करने के लिए हर element को list के बाकी सभी element से compare करते है और अगर कोई भी छोटा element मिलता है तो हम उसे उस element

bubble sort feature

Bubble Sort In Hindi In Data Structure.

हेलो friends , आज के इस blog post में मैं आपको bubble sort के बारे में बताने जा रहा हूँ| bubble sort को हम ‘sorting by exchange ‘ भी कहते है, क्योकि bubble sort में हम successive smallest element को ढूंढ़ने के लिए एक element को उसके adjacent element से compare करते है| bubble sort

insertion sort in hindi

Insertion Sort In Hindi

हेलो friends , आज के इस blog post में मैं आपको insertion sort के बारे में बताने जा रहा हूँ| insertion sort के अंतर्गत हम records को एक sorted file और list में insert करते है | पर रिकॉर्ड को फाइल में insert करने के पहले हमें उसे insert करने का प्रॉपर place पता होना

searching in data structure

Searching In Data Structure

Hello Friends, In this blog post I am going to let you know about the searching process in the data structure. Here searching is meant for finding a particular record in the file, table, list or database. In other words, searching is the process of finding the desired record in a search table. The search

internal sorting and external sorting in data structure in hindi feature

Internal Sorting and External Sorting In Data Structure In Hindi

हेलो दोस्तों आज के इस ब्लॉग पोस्ट में मैं आपको sorting के बारे में बताने जा रहा हूँ | आज के इस ब्लॉग में हम बात करने वाले है internal sorting and external sorting In Hindi | अगर अपने कभी data स्ट्रक्चर सब्जेक्ट को स्टडी किया होगा तो अपने इस सॉर्टिंग के बारे में जरूर

backtracking-in-datastructure

What is backtracking in data structure?

Hello friends, In this, in this blog post I am going to let you know about one more interesting technique name as backtracking to solve the problem in the data structure. Which most of you would have read during your study period or engineering. Backtracking is very helpful in solving the problems where we have

strongly-connected-graph-featureimg

What is a strongly connected graph?

In this blog post, I am going to discuss a strongly connected graph. As we have learned about various types of the graph in our previous blog. We read about the directed graph where each edge is within an ordered pair of vertices mean to say that the first element of this ordered pair is

graph-feature-img

Graph: Types of the graph in data structure 2019?

A graph is a structure containing (V, E) set of objects. Here V represents the vertices or node and E represents the edges or arcs. Say V= {v1, v2, v3, v4, v5} and E = {e1, e2, e3, e4}. Each edge Ek is identified with an unordered pair (Vi, Vj) of vertices. The vertices Vi,

avl-featureimg

AVL Tree In Data Structure?

AVL stands for Adel’son – Vel’skii and Landis, These two were the Russian mathematician having full names as G.M. Adel’son Vel’skii and E.M. Landis. They both described the property in 1962 about the height balance tree Which was honored as AVL TREE. As per their theory or property, a height balance tree is a binary

tree-indatastructure-feature

Tree: What is a tree in data structure 2019?

The tree is considered as a most flexible, versatile and powerful data structure which is used in representing the data processing in a hierarchical relationship. It is one of the important data structure in the field of computer science. We can also define a tree as a finite set of one or more data item

compaction-feature

Compaction: Dynamic memory management.

In this tutorial, I am going to explain one of the methods of dynamic memory management that is name as compaction. In this process, all marked or used node is shifted to one end and variable or available memory is kept at another end. In a very simple language, the compaction is a process in

dynamicmemorymanagement

Dynamic Memory Management

Dynamic memory management is the memory which is given instantly to a program variable or data structure when it is needed. Here we are explaining this dynamic memory management phenomena with reference to the data structure. There are many occasion while we don’t know about the memory needed by the program or program variable before

josephus-problem-feature-image

Josephus problem & Circular linked list?

In this blog post, I am going to discuss an interesting Josephus problem which you would have studied in the data structure. This problem includes soldiers surrounded by the enemy and only one horse which a single soldier can use to escape out of the enemy. you will also learn how to solve this Josephus

circular-linked-list

What is a circular linked list?

A list with various numbers of the node containing data and address pointer and the list start and finish at the same first node is known as a circular linked list. this list forms a circle and having a common start and endpoint. As in the case of the linked list, we have seen that