# Dr. Anusha

Creator of whiletrue.live.

## Primitive Data Structure vs Non Primitive Data Structure

Primitive data structure is a fundamental type of data structure that stores the data of only one type whereas the non-primitive data structure is a type of data structure which is a user-defined that stores the data of different types in a single entity.

Posted September 12, 2022 by Rohith and Anusha ‐ **1 min read**

⌖ quick-references blog primitive-data-structure non-primitive-data-structure differences

## Full Binary Tree vs Complete Binary Tree

A full binary tree is a binary tree in which all of the nodes have either 0 or 2 offspring. In other terms, a full binary tree is a binary tree in which all nodes, except the leaf nodes, have two offspring. When all of the levels of a binary tree are entirely filled, except for the last level, which can contain 1 or 2 children nodes and is filled from the left, it is said to be a complete binary tree.

Posted September 12, 2022 by Rohith and Anusha ‐ **1 min read**

⌖ quick-references blog full-binary-tree complete-binary-tree

## B Tree vs B+ Tree

B-Tree is known as a self-balancing tree as its nodes are sorted in the inorder traversal. In B-tree, a node can have more than two children. B-tree has a height of logM N (Where â€˜Mâ€™ is the order of tree and N is the number of nodes). B+ tree eliminates the drawback B-tree used for indexing by storing data pointers only at the leaf nodes of the tree. Thus, the structure of leaf nodes of a B+ tree is quite different from the structure of internal nodes of the B tree.

## Selection Sort vs Bubble Sort

The selection sort algorithm generally is the first sorting algorithm that is taught to us. Here in every iteration of the inner loop, the smallest element is replaced with the starting element in each loop. The bubble sort algorithm might look a little bit confusing when we first study it. But here is the easy explanation of it. Here swapping is carried on in two ways. In every iteration of the outer loop, the largest element is found and swapped with the last element in the loop.

Posted September 12, 2022 by Rohith and Anusha ‐ **1 min read**

⌖ quick-references blog selection-sort bubble-sort differences

## Quick Sort vs Merge Sort

Quick sort is a comparison based sorting algorithm that follows the divide and conquer technique to sort the arrays. In quick sort, we usually use a pivot (key) element to compare and interchange the position of the element based on some condition. Merge sort is a most important sorting techniques that work on the divide and conquer strategies. It is the most popular sorting techniques used to sort data that is externally available in a file.