My previous computer science review post took a look at the tree data structure. This time around we will be exploring a specific kind of binary tree: The Binary Search Tree. Let’s not waste any more time and just jump right in! What is a Binary Search Tree? A Binary Search Tree (BST) is a binary tree such that the following holds true: The left sub-tree contains only nodes whose values are less than the parent’s value....
You may have noticed that I’ve been putting a lot more work into writing posts for my Computer Science Review series lately. The last installment of this series took a look at binary search trees. This time around we will be taking some time to review one of my favorite data structures: Graphs. What is a Graph? If you look at the formal definition of a graph, such as the one that you might get in a discrete mathematics course, you’ll get something along these lines: A graph is an ordered triple (N, A, g) where N is a nonempty set of nodes or vertices, A is a set of arcs or edges, and g is a function associating each arc a with an unordered pair {x, y} of nodes....
In my previous review series, I wrote a brief review of set theory. This time around we’ll take a look at the binary tree data structure. The tree structure is very common, incredibly useful data structure in the field of computer science and it’s essential that any engineer understand how they work. The Tree Data Structure A tree, unlike some other data structures, such as an array, linked list, stack, or queue, is a hierarchical data structure....