(Algorithms)You are given a tree represented by the following data structure. Nodes have three fields: element, left-child, and right-child. The element is an integer. Write a procedure (pseudocode) with the input parameter the location of the root node (or a pointer to the root node), and that computes the average value of the elements in the tree. However, do not use recursion. Use a stack instead. Analyze the running time of your algorithm.