Inorder traversal: (Left, Root, Right) Preorder traversal: (Root, Left, Right) Postorder traversal: (Left, Right, Root) 1) For the following binary tree what is the root? which are the leaves For all the nodes of the tree name the parent list the children list the siblings compute the height, depth, and size (number of nodes in the subtree). Give the result of preorder, postorder, and inorder traversal.

? \\ b-d-h 2 8