binary tree that runs in linear time and does not use stack - describein pseudo-codea nonrecursive method for performing an in-order traversal of binary tree in linear time - let be binary tree with nodes ( may be realized with an array list or linked structuregive linear-time algorithm that uses the methods of the binary tree interface to traverse the nodes of by increasing values of the level numbering function given in section this traversal is known as the level order traversal - the path length of tree is the sum of the depths of all the nodes in describe linear-time method for computing the path length of tree (which is not necessarily binaryc- define the internal path lengthi( )of tree to be the sum of the depths of all the internal nodes in likewisedefine the external path lengthe( )of tree to be the sum of the depths of all the external nodes in show that if is proper binary tree with nodesthen (ti(tn projects - implement the binary tree adt using an array list - implement the tree adt using linked structure - write program that draws binary tree - write program that draws general tree -