Let each operation takes cc time.
c * g(n)
for i : 1 to length of A
if A[i] is equal to x
return TRUE
return FALSE
(Nc + c) N: the number of elements in the arrayc: operations done on each element +c: the return false if the element does not exist in the array
A rooted binary tree is full if every vertex has either two children or no children.
Example of Catalan Numbers use case.
Catalan numbers notation and short explanation of it.
Use - LookUP: Combinatorics (non crossing combinations) ex: ((())), ()(()), ()()(), (())(), (()())
ref: https://www.geeksforgeeks.org/program-nth-catalan-number/