describe the euler tour of the subtree rooted at in code fragment figure euler tour traversal of binary tree code fragment the euler tour of the subtree of binary tree rooted at the running time of the euler tour traversal of an -node tree is easy to analyzeassuming each visit action takes ( time since we spend constant amount of time at each node of the tree during the traversalthe overall running time is (nthe preorder traversal of binary tree is equivalent to an euler tour traversal such that each node has an associated "visitaction occur only when it is encountered on the left likewisethe inorder and postorder traversals of binary tree are equivalent to an euler tour such that each node has an associated "visitaction occur only when it is encountered from below or on the rightrespectively the euler tour traversal extends the preorderinorderand postorder traversalsbut it can also perform other kinds of traversals for examplesuppose we wish to compute the number of descendents of each node in an -node binary tree we