#Binary Trees Example

1 messages · Page 1 of 1 (latest)

rose prawnBOT
#

<@&987246399047479336> please have a look, thanks.

rose prawnBOT
#

While you are waiting for getting help, here are some tips to improve your experience:

Code is much easier to read if posted with syntax highlighting and proper formatting.

If nobody is calling back, that usually means that your question was not well asked and hence nobody feels confident enough answering. Try to use your time to elaborate, provide details, context, more code, examples and maybe some screenshots. With enough info, someone knows the answer for sure.

Don't forget to close your thread using the command </help-thread close:1027500463647621170> when your question has been answered, thanks.

formal owl
#

thats not a binary tree

#

branching factor is the maximum number of children that an arbitrary node has in the tree

snow sage
#

and how do I go about calculating that

formal owl
#

count 😛

snow sage
#

3?

formal owl
#

yes

snow sage
#

omg

#

im stupid lol thank you

#

so # of nodes is 12, height is 4, leaves is 5, and the final one is neither?

formal owl
#

ohh wait

#

wikipedia actually says branching factor is the average number of children that a node has

snow sage
#

thats why im confused

#

are my other answers correct though?

formal owl
#

depends on how you define nodes. if leafes count as nodes everything should be correct

#

now you just have to find out how branching factor is defined for this particular excercise

snow sage
#

I think it should be 5

#

pretty sure its the max number of children

#

thanks for the help

rose prawnBOT
#

Closed the thread.

formal owl
#

but 5 would be incorrect in that case

snow sage
#

3 sorry

#

i was looking at something else and thinking too fast