Find Node in Binary Search Tree - Part 1: Recursive Solution

In this video, we will see how to find the node with a given key in a binary search tree, using a recursive solution. The binary search tree property (i.e. that for each node, everything in the left subtree has a smaller key, and everything in the right subtree has a larger key) makes it easy to search for a given key in a BST efficiently. C++ code for find Node function: cs.phyley.com/binary-search-tree/find-node/part-1-recursive-solution