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 some algorithm for tree data structure visualization? I tried googling, but couldnt find any. I’m pretty sure there has to be some algorithm for this not that simple task. Or anyone has some ideas?
Assumption: you want each node to be displayed such that it is centered above its child nodes.
To achieve this, calculate the width of each node, which I define as the amount of horizontal space required to display this node’s entire subtree, such that it doesn’t overlap with its left or right siblings’ subtrees.
This leads to:
So, do a depth-first traversal through the tree to calculate each node’s width. To display, do a breadth-first traversal to draw the tree level by level.
This is the rough idea of how to go about it. You might want to tweak the width calculation depending on the details of how you would like to render the tree.