please complete #2dont use others answersthank you! 1. Given the tree BST below, fill in the values in the table.0007000400120002000600090019000300050008001100150020PropertyValue3Height of treeHeight of node 82Depth of node 91Node 6 degreeTree degree00090008Name the nodes in left subtree ofnode 1200112Order of tree8Internal path length3External path length2. Perform the traversals on the above tree.a) preorder:b) inorderc) postorder:d) reverse postorder:

Note: Answering the 2nd question as per the instruction. Task : Given the Binsry Search Tree. Find the : preorder inorder order post order reverse postorder(a) Preorder In preorder, until the recursion stack is not empty : visit the node Call preorder on the left subtree. Call preorder on the right subtree. Based on this, preorder traversal is : 0007 , 0004 , 0002 , 0003 , 0006 , 0005 , 0012 , 0009 , 0008 , 0011 , 0019 , 0015 , 0020. (b) Inorder order In inorder, until the recursion stack is not empty : Call in order on the left subtree. visit the node. Call in order on the right subtree. Based on this, inorder traversal is : 0002 , 0003 , 0004 , 0005 , 0006 , 0007 , 0008 , 0009 , 0011 , 0012 , 0015 , 0019 , 0020. (c) Postorder In postorder, until the recursion stack is not empty : Call preorder on the left subtree. Call preorder on the right subtree. visit the node. Based on this, postorder traversal is : 0003 , 0002 , 0005 , 0006 , 0004 , 0008 , 0011 , 0009 , 0015 , 0020 , 0019 , 0012 , 0007. (d) Reverse postorder In reverse postorder : find the postorder reverse the postorder. Based on this, reverse postorder traversal is : 0007 , 0012 , 0019 , 0020 , 0015 , 0009, 0011 , 0008 , 0004 , 0006 , 0005 , 0002 , 0003.