In the earlier article, Lowest Common Ancestor (BST), I discussed how you can use the special ordering of a Binary Search Tree to quickly and easily identify the Lowest Common Ancestor of two nodes. Of course, not all trees are BSTs and so in this article we’ll look at a way of finding the LCA in a non-BST. Continue reading
On all future code related posts, for all full working code examples, I’ll be provided a link to the Ideone online code editor. It’s a little like pastebin but with the bonus of allowing you to both fork and compile the code online. Continue reading
The Binary Search Tree (BST) is a tree like data structure that allows for the quick lookup of data. They work by storing inserted data in a tree like structure that uses the “divide and conquer” approach to locate data. Each node in the tree has, at most, two children. The left hand side (lhs) node will always contain a value that is less than it’s parent. The right hand side (rhs) node will always contain a value that is greater-than or equal to it’s parent.
So, my web hosting is provided by AtSpace.com and my DNS hosting is provided by Heart Internet. Why are they seperate? Well, it's simply that I originally purchased my domains with Heart but have changed web hosts a couple of times. Since my DNS is configured just how I like it and since it really shouldn't matter who hosts your DNS (as long as they provide the ability to set A and CNAME records) it shouldn't be a big deal. Or so I thought!