$(1)$ Sort an array with bubble sort in ascending order.

void BubbleSort$($int $*$ array, int total$)$

$//$ total is the size of the array.

$(2)$ Given the root of a binary tree, calculate its depth.

$(3)$ Binary tree inorder traversal in non$-$recursive manner with the help of stack.

Note: It is not necessary to implement stack operations, and you can just use

them as needed.