Java

What is the wortst case depth of a binary tree? What is the worst case runtime to search for a value in a binary tree? What is the expected runtime to search for a value in a binary tree? What is the runtime to find the longest branch in a binary tree? Describe what makes a binary tree a valid binary tree. class BSTRoot public int value; public BSTRoot left public BSTRoot right) Write a function to find whether a value exists in a binary tree given the root and a value. Write a function to find the length of the longest branch in a binary tree given the root