Data Structure
Networking
RDBMS
Operating System
Java
MS Excel
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP
Binary search tree (BST) is a special type of tree which follows the following rules −left child node’s value is always less than the parent Noteright child node has a greater value than the parent node.all the nodes individually form a binary search tree.Example of a binary search tree (BST) −A binary search tree is created in order to reduce the complexity of operations like search, find minimum and maximum.Search operation in BSTPerforming a search in a binary search tree, We need to search for a key in the tree. For this, We will compare the key with the root ... Read More
Linux shell scripting has many powerful tools to process the data in files. One such feature is to find patterns and count the number of occurrences of matched patterns. One such example is to count the number of occurrences of a specific word in a given file. This is achieved by combination of commands for pattern search and counting. Below are the approaches which can be used for this need.Input fileLets use the below file for demonstrating the examples.$ cat inspire.txt Mastering anything needs practice. It also needs patience. And it needs time and other resources.Using grep and wcThe grep ... Read More
It often becomes essential to know not just the count of files in my current directory but also the count of files from all the subdirectories inside the current directory. This can be found out using theUsing lswe can use ls to list the files, then choose only the ones that start with ‘-‘ symbol. The R option along with the l option does a recursive search. The ‘-c’ option counts the number of lines which is the number of files.ls -lR . | egrep -c '^-'Running the above code gives us the following result −13Using find With Hidden FilesThe ... Read More
A binary search known as logarithmic search is a search algorithm that searches for an element in a sorted array. The algorithm recursively divides the array into two halves, if the element is found at the mid position then return otherwise call the divide and check again until the element is found.WorkingThe algorithm works by comparing the middle element of the sorted array with the element that is to be searched.If the search element is equal to the middle element, then return the index of the element.If the search element is greater than the middle element, search in the left ... Read More
Gogo is a tool to bookmark directories with long and complicated paths in the Unix shell. Because the long parts are difficult to remember and cumbersome to type in. In this article we'll see how to install go go and use it.Installing gitWe first need to have git installed in our system which will be needed for gogo installation. To install git in an Ubuntu system follow the below command.$ sudo apt install gitRunning the above code gives us the following result −[sudo] password for ubuntu: Reading package lists... Done Building dependency tree Reading state information... Done The following additional ... Read More
To use case-insensitive switch-case in JavaScript, make the input all upper or all lowercase.ExampleYou can try to run the following code to learn how to use a case-insensitive switch: JavaScript Strings var str = "amit"; str = str.toUpperCase(); switch (str) { case 'AMIT': document.write("The name is AMIT "); break; case 'JOHN': document.write("The name is JOHN "); break; default: document.write("Unknown name") } document.write("Exiting switch block");
A multiway tree is defined as a tree that can have more than two children. If a multiway tree can have maximum m children, then this tree is called as multiway tree of order m (or an m-way tree).As with the other trees that have been studied, the nodes in an m-way tree will be made up of m-1 key fields and pointers to children.multiway tree of order 5To make the processing of m-way trees easier some type of constraint or order will be imposed on the keys within each node, resulting in a multiway search tree of order m ... Read More
Basic conceptThe multidimensional binary search tree (abbreviated k-d tree) is defined as a data structure for storing multikey records. This structure has been implemented to solve a number of "geometric" problems in statistics and data analysis.A k-d tree (short for k-dimensional tree) is defined as a space-partitioning data structure for organizing points in a k-dimensional space. Data structure k-d trees are implemented for several applications, for example, searches involving a multidimensional search key (e.g. range searches and nearest neighbor searches). k-d trees are treated as a special case of binary space partitioning trees.Informal descriptionThe k-d tree is a binary tree ... Read More
The rebalancing Algorithms can be performed in following way −Day-Stout-Warren AlgorithmWe can implement actually rebalance method using the Day-Stout-Warren Algorithm.It's linear in the number of nodes.The following is a presentation of the basic DSW Algorithm in pseudo code.A node is allocated called as the "pseudo-root" and make the tree's actual root as the right child of the pseudo-root.Call tree-to-vine function for converting tree to sorted linked list with the pseudo-root as its argument.Call vine-to-tree function for converting sorted linked list to tree again with the pseudo-root and the size (number of elements) of the tree as its argument.The tree's actual ... Read More
We select a memory block first.Then we select local Bloom Filter within each block.It might cause imbalance between memory blocksThis filter is efficient, but poor false positive rate(FPR).At first instance, blocked Bloom filters should have the same FPR (False Positive Rate) as standard Bloom filters of the same size.Blocked Bloom Filter consists of a sequence of block b comparatively less than standard Bloom filters (Bloom filter blocks), each of which fits into one cache-line.Blocked Bloom filter scheme is differentiated from the partition schemes, where each bit is inserted into a different block.Blocked Bloom Filter is implemented in following ways −Bit ... Read More