Make a binary search tree for the letters DARTHPLAGUEIS. In the comments, tell me the depth of the tree, which nodes are leaf nodes, how many external nodes there are, the internal path length, and the external path length (you don't have to send the actual tree).

If you have forgotten what any of these words mean this website is a good resource http://www.categories.acsl.org/wiki/index.php?title=Data_Structures

The depth of the tree is 5, leaf nodes are A,E,I,S and U, amount of external nodes are 13, internal path length is 33, external path length is 55.

Depth = 5 5 leaf nodes: A E I S U 14 External nodes Internal path length = 33 External path length = 48

Depth: 5

Leaf nodes: A, E, I, S, U

Number of external nodes: 14

Internal path length: 33

External path length: 59

Depth: 5 Leaf Nodes: A,E,I,S,U External Nodes: 14 Internal Path Length: 33 External Path Length: 59

depth:5

leaf nodes: a,e,i,s,u

internal path length:33

external path length:59

The depth of the tree is 5.

The leaf nodes are A, E, I, S and U.

The amount of external nodes are 14.

The internal path length is 33.

The external path length is 58.