Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
Is there a data structure designed to find the depth of a tree(not a binary tree) quickly?
Is the D-forest ok?
I need more details about the data structure.
Thanks in advance.
You could store a number in every node of the tree that is the depth of the tree below the node. On insertion or deletion, you’ll have to recompute the values at all the nodes from the root to the affected node. Would this work for you?