A binary tree is a tree having at most two children whereas a binary search tree is the tree in which the elements in the left side of the tree are less than the elements in the right side of the tree. In this article, we will write Go language programs to check if a binary tree is a binary search tree. Here we will use different examples to provide a better understanding of the concept. Algorithm Step 1 − Create a Node struct with three fields the data of the node of type int, Left and right subtree ... Read More
A binary tree is a tree which has at most two children and height refers to the no. of levels in the tree. In this article, we will use two examples to find the height of a binary tree. In this Golang article we will write programs to print the height of a binary tree. Syntax func append(slice, element_1, element_2…, element_N) []T The append function is used to add values to an array slice. It takes number of arguments. The first argument is the array to which we wish to add the values followed by the values to add. ... Read More
Two of the most popular corporate Linux distributions on the market are Oracle Linux and Red Hat Enterprise Linux. Despite the fact that the two operating systems share the same source code, there are some significant variations between them that merit investigation. The similarities and differences between Oracle Linux and Red Hat Enterprise Linux will be highlighted when we compare the two operating systems in this post. What are Oracle Linux and Red Hat Enterprise Linux? A Linux distribution called Oracle Linux is based on the free and open-source CentOS operating system. It was created by Oracle Corporation and is ... Read More
Operating system hardening involves protecting an operating system to lower its attack surface and improve its overall security posture. In order to do this, the operating system settings must be configured. Updates and patches must also be installed, unused programs and services must be disabled, and security measures like firewalls, intrusion detection systems, and antivirus software must be put in place. Operating system hardening reduces the amount of potential attack pathways that hackers might take in an effort to decrease the probability that an attack would be successful. Operating system hardening is an ongoing process that requires regular review and ... Read More
In this article, we will write Go language programs to merge two sorted linked lists. A linked list is a set of two fields with the value that is the data and the next pointer which points to the next node in the list. A linked list is a dynamic data structure with two pointers head and tail, where head points to the first value and tail points to the last value. Here, we will use two examples to merge the sorted linked list. Demonstration This demonstration represents two sorted linked lists “LIST1” and “LIST2”. we need to merge these ... Read More
Data is stored persistently on hard drives or other storage media using on-disk data structures, enabling access and modification even after a system restart or power loss. The retrieval, storage, and manipulation of data on the disc, which normally has longer access times and less bandwidth than memory, are all optimized by these data structures. The types of on-disk data structures, storage formats, data compression methods, indexing methods, sorting algorithms, performance concerns, and applications will all be covered in this article. What are On Disk Data Structures? On-disk data structures describe how data is kept on a tangible storage medium, ... Read More
In this Go language article, we will write programs to print descending order patterns using a nested for loop as well as using the two nested loops inside the outer loop. Descending order pattern means the higher order elements are placed first and in pattern the rows with highest no. of rows is placed first. Demonstration This demonstrates a descending order pattern where every row starts from 1 and decreases by 1 at each column until the end of row. In the top row it has 1-6 numbers and in second row it has 1-5 and it goes on till ... Read More
A pascals triangle is a form of triangle in which binomial coefficients are arranged in triangular form. Here, the triangle starts with 1 and in every row the beginning and ending digit is 1. In this article, we will write Golang programs to print right pascals triangle. Demonstration This demonstration explains a right pascal triangle, in which every row shows the coefficient of binomial expansion for the power of (a+b)^n, where a and b =1. The first row has single 1, second row has 1 and 1 , the third row has 1, 2 and 1 and so on. 1 ... Read More
In this article, we will write Golang programs to build a right triangle using numbers. The numbers imply that the triangle is composed of numbers. There are many ways to perform this operations, here we have used different examples to provide a better understanding of the concept. Demonstration This demonstration explains a right angled triangle representation using numbers. Each row of this triangle is consist of number starting from 1 to the row number. From top the first row has 1, second row has 1, 2 and it goes on. 1 1 2 1 2 3 1 ... Read More
Excel is a powerful spreadsheet program developed by Microsoft. It is widely used for organizing, analysing, and manipulating data in various industries and professions. To export multiple columns into individual text files in Excel, you can use VBA (Visual Basic for Applications) macros. Steps to Export or Save Each Row as Text File in Excel Here's an example of how you can do it: Step 1 :Open the Excel file in which you want to export the rows as text files. Press Alt + F11 to open the Visual Basic Editor in Excel. Insert a new module by clicking ... Read More
Data Structure
Networking
RDBMS
Operating System
Java
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP