Team Geeks

AVL vs RB Trees ,which is Good ? With Applications                 To understand this comparison let's understand the BST , because both AVL and the RB trees are the type of  BST which is Binary Search tree which also a type of Tree data structure which further used for storing a particular data more sorted. Binary Search Trees (BST) :        So it is a BST where each circle containing value in it represents or called as node where first blue circle is called as Root node or starting point of tree .After the root node below structures are known as sub-trees.        The rule of BST is ;  All the values less than the root node value are placed on left side of  root and all the value greater than the root are placed on the right as shown in the figure  ex. if you want to find a particular element ex. 3 first from root you have to go to left because 3<4 and after that you have to go ...

Comparative Study of Different Mobile OS                                        Nowadays proper operating system for your mobile is very essential and for that competition between Android and iOS is on very high other than that most of the other operating system are not used.                 So, in this blog we will focus on comparative study between Android and iOS and this will help you to find the nice feature of both operating system and  to answer your question which is better ?  What is Android ?              Android is the most popular mobile operating system being used currently. Android is based on a modified version of the Linux kernel and other open source software, designed primarily for touchscreen mobile devices such as smartphones and tablets. Android is deve...