Hi Everyone! Can you show the Asymptotic complexity of this algorithm. Thanks

Pseudo Code 1 d=0, endtree=0 2 00, Note(0)=1, Node(1)=0, Node(2)=0 3 while endtree-1 9 Split tree 10 else 11 Node(2i+1)=-1 12 Node(2i + 2) = -1 end if end do end if 16 d-d + 1 17 end while 13 14 15 Pseudo Code 1 d=0, endtree=0 2 00, Note(0)=1, Node(1)=0, Node(2)=0 3 while endtree-1 9 Split tree 10 else 11 Node(2i+1)=-1 12 Node(2i + 2) = -1 end if end do end if 16 d-d + 1 17 end while 13 14 15