Data Structure & Algorithms

Complete Binary Tree ordered and increasing in order 1, 2, 3, 4, 5 by levels


                  1
            2         3 
      4       5



Node = 10/2 = 5    

1010
 
Time complexity = O(log N) 
 
input = root, node_search
 
Output = present or not 

log2(10)