Share & grow the WordPress knowledge!
We want to connect the people who know the people who need it and bring people together with different perspectives so, they can understand each other better, and empower everyone to share their knowledge for the benefit of the rest of the world.
SSL certificate
Digital Ranger
https://wordpress.org/plugins/really-simple-ssl/ use this plugin for free ssl
https://wordpress.org/plugins/really-simple-ssl/ use this plugin for free ssl
See lessWhat is Max Heap?
Jyotika Sharma
Max Heap is the heap in which every node's key value will be greater than the key values present at its left and right child. From the max heap, we can easily find the maximum value storing node because it will be the root node of the tree.
Max Heap is the heap in which every node’s key value will be greater than the key values present at its left and right child. From the max heap, we can easily find the maximum value storing node because it will be the root node of the tree.
See lessWhat is Min Heap?
Jyotika Sharma
Min Heap is the heap in which every node's key value will be less than the key values present at its left and right child. From min-heap, we can easily find the minimum value storing node because it will be the root node of the tree.
Min Heap is the heap in which every node’s key value will be less than the key values present at its left and right child. From min-heap, we can easily find the minimum value storing node because it will be the root node of the tree.
See lessWhat is Heap?
Jyotika Sharma
In the data structure, a heap is a specialized binary tree-based structure that satisfies two major properties generally known as heap properties. which includes : 1. Shape 2. Order
In the data structure, a heap is a specialized binary tree-based structure that satisfies two major properties generally known as heap properties. which includes :
See less1. Shape
2. Order
What is AVL Rotation?
Jyotika Sharma
It is a special operation that is mainly used in AVL trees. Most of the time it has been seen that after the operation of insertion or deletion some time the balance factor of any node in the tree is affected so as to render the binary search tree unbalanced tree AVL, which is called rotation.
It is a special operation that is mainly used in AVL trees. Most of the time it has been seen that after the operation of insertion or deletion some time the balance factor of any node in the tree is affected so as to render the binary search tree unbalanced tree AVL, which is called rotation.
See lessWhat is Algorithm?
Jyotika Sharma
An algorithm is a step by step method or a process followed or used to solve a particular problem. If the problem is viewed as a function, then an algorithm is an implementation for the function that transforms a required input for the function to the corresponding output which will be a solution ofRead more
An algorithm is a step by step method or a process followed or used to solve a particular problem. If the problem is viewed as a function, then an algorithm is an implementation for the function that transforms a required input for the function to the corresponding output which will be a solution of the problem. There can be different algorithms to solve the same particular problem as a given solution solves only one problem at a time.
See lessWhat is Searching?
Jyotika Sharma
Searching operations are used to seek or find a particular element in the data structures depending upon some key-value, record, or based upon some criteria. The location of the required data item will be returned if it will be present in the data structure; otherwise, NULL value will be returned.
Searching operations are used to seek or find a particular element in the data structures depending upon some key-value, record, or based upon some criteria. The location of the required data item will be returned if it will be present in the data structure; otherwise, NULL value will be returned.
See lessWhat is Merging?
Jyotika Sharma
Merging is a process of combining the records in two different files into a single file. It can be sorted based or un sorting based
Merging is a process of combining the records in two different files into a single file. It can be sorted based or un sorting based
See lessWhat is Sorting?
Jyotika Sharma
Sorting is used to arrange all the elements of data structure in the given order; either ascending or descending. Sorting will be based upon the data-type of element stored in the structure. The most common known sorting techniques include bubble sort and insertion sort, etc
Sorting is used to arrange all the elements of data structure in the given order; either ascending or descending. Sorting will be based upon the data-type of element stored in the structure. The most common known sorting techniques include bubble sort and insertion sort, etc
See lessWhat is Deletion?
Jyotika Sharma
This operation is exactly opposite to the creation, here in this case already allocated memory is destroyed for the variable or object and it is returned back to the free spool of memory. This operation destroys the data structure.
This operation is exactly opposite to the creation, here in this case already allocated memory is destroyed for the variable or object and it is returned back to the free spool of memory. This operation destroys the data structure.
See lessWhat is Insertion?
Jyotika Sharma
An operation typically used in combination with data structures and that creates a data structure is known as creation. This operation reserve memory for the data elements and is responsible for the creation of a memory block for the new element. It can be carried out at compile-time and run-time.
An operation typically used in combination with data structures and that creates a data structure is known as creation. This operation reserve memory for the data elements and is responsible for the creation of a memory block for the new element. It can be carried out at compile-time and run-time.
See lessWhat is Traversal?
Jyotika Sharma
Traversal is the most common and basic operation by which each and every elements of the data structure is accessed or visited at least one time for some processing, here details of the processing need be disclosed. Being a basic operation this operation assists several different other operations liRead more
Traversal is the most common and basic operation by which each and every elements of the data structure is accessed or visited at least one time for some processing, here details of the processing need be disclosed. Being a basic operation this operation assists several different other operations like insertion, deletion, searching, etc
See lessWhat are different operations on Data Structure?
Jyotika Sharma
The different possible operations that are to be carried out on data are nothing but designing of data structures. The various that can be performed on data structures are: 1. Traversal 2. Insertion 3. Deletion 4. Searching 5. Sorting 6. Merging
The different possible operations that are to be carried out on data are nothing but designing of data structures. The various that can be performed on data structures are:
See less1. Traversal
2. Insertion
3. Deletion
4. Searching
5. Sorting
6. Merging
What is Graph?
Jyotika Sharma
The graph is another important non-linear data structure which is basically an extension of tree, in the situation when data is not in sequential order but also not exactly in hierarchical order too, we prefer the implementation of the graph. Nodes of the graph need not be the same order but can beRead more
The graph is another important non-linear data structure which is basically an extension of tree, in the situation when data is not in sequential order but also not exactly in hierarchical order too, we prefer the implementation of the graph. Nodes of the graph need not be the same order but can be multiple relationships among the nodes of the data.
See lessWhat is Tree ?
Jyotika Sharma
A tree is one of the most important non-linear data structure which is sequentially made up of a finite set of elements called nodes. This set either is empty or consists of a node called the root together with its branches, in case of binary tree root will have two main branches, called left and riRead more
A tree is one of the most important non-linear data structure which is sequentially made up of a finite set of elements called nodes. This set either is empty or consists of a node called the root together with its branches, in case of binary tree root will have two main branches, called left and right sub tree
See less