Any tree that its elements have at most two children nodes is called a binary tree. Those children nodes are referred typically as the left and the right child. As we can see a tree is not a linear data structure and represents nodes that are connected by edges. A tree has the following properties:…
Read moreCategory: Algorithms
Bubble Sorting in Python
Bubble Sort is the simplest sorting algorithm. It works by changing positions in the adjacent elements if they are in the wrong order. Basic Example Assume we have the following list of integers: (32, 5, 12, 9, 72) With bubble sort, we will traverse through the list and compare the adjacent elements, as many times…
Read more