Data Structures

/Data Structures

Stacks vs. Queues

Stacks and queues are both very commonly used data structures. They dynamically store and retrieve data items in two different ways. Let’s take a look at these two principles, so we can understand what differences they have and where their uses may be applicable. Definition: Stacks and queues are both abstract data structures and the [...]

By |2019-04-07T13:26:28+03:00December 6th, 2018|Categories: Explained Simply|Tags: |0 Comments

Trees vs. Graphs

Trees and graphs are data structures used to resolve various complex problems. Knowing the difference between them is useful in terms of better understanding of the non-linear way of storing data. Definition: Trees and graphs are both abstract data structures. They are a non-linear collection of objects, which means that there is no sequence between [...]

By |2019-04-07T13:20:21+03:00January 1st, 2019|Categories: Explained Simply|Tags: , |0 Comments

B-tree vs. Binary Tree

B-Trees and binary trees are both non-linear data structures and while their names may sound similar, they’re very different in nature. In this article, we will compare them to make them easier to distinguish. B-Tree B-tree is a self-balancing tree data structure in which a node can have more than two children. The height of [...]

By |2019-04-07T13:17:28+03:00February 11th, 2019|Categories: Explained Simply|Tags: |0 Comments
We use cookies on this site to improve our service, perform analytics and remember website preference. By using the site, you consent to these cookies (Privacy policy). I consent to cookies