The document describes a task to implement a Python method called _find in a binary tree class. This method should search for a specified key starting from a given node p and return true or false based on whether the key exists in the tree. Additionally, it requests an analysis of the time complexity of the function.

1. In a binary tree class, implement a Python method _find(p: _Node, key: int), that takes in a key
and a reference to a node p, where p represents the root of a binary tree, the function should
search the binary tree for key, and returns T/F accordingly. What is the time complexity of your
function?