The structure of the Binary search tree as follows:
A
/ \
B D
/ \
C G
\
E
\
F
Step 1: Create an empty binary search tree.
Step 2: Insert the node "A" into the tree.
Step 3: Insert the node "B" into the tree, with "A" as its left child.
Step 4: Insert the node "C" into the tree, with "B" as its right child.
Step 5: Insert the node "D" into the tree, with "A" as its right child.
Step 6: Insert the node "E" into the tree, with "C" as its left child.
Step 7: Insert the node "F" into the tree, with "E" as its right child.
Step 8: Insert the node "G" into the tree, with "D" as its right child.
Step 9: The resulting binary search tree is as follows:
A
/ \
B D
/ \
C G
\
E
\
F
Learn more about binary search tree here :
https://brainly.com/question/14990156
#SPJ4
