I took a look at the “Is This a Binary Search Tree?” challenge at HackerRank. If interested in learning about this challenge and associated requirements use the following URL: https://www.hackerrank.com/challenges/ctci-is-binary-search-tree
The idea is quite simple. A BST should have all nodes in an ascending order when traversed using an in order traversal algorithm. If they do not, a value in a node is out of order rendering the tree as an invalid BST. Continue reading “Is this a Binary Search Tree”