Design a data structure to store hierarchical information – Algorithms and Me
Till now we have learned about binary tree and binary search tree. There is one more form of tree that is Nary tree. As name suggests, Nary tree is a tree where each node has N children. Advance implementations of Nary trees can have flexibility of having different N for each node of the tree. The tree which we will implement will be one such tree. Figure below shows N-ary tree
Read full article from Design a data structure to store hierarchical information – Algorithms and Me
No comments:
Post a Comment