A lot of datastructures in CS are binary (BST, heaps, etc). What would be good reasons for implementing them in non-binary form? Ie. have a heap with 3 children for each nodes, etc.
Share
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.
A lot of datastructures in CS are binary (BST, heaps, etc). What would be good reasons for implementing them in non-binary form? Ie. have a heap with 3 children for each nodes, etc.
Trees with more than two children per node are a tradeoff, as they will have shallower depth at the expense of more links per node. The B-tree, commonly used in databases and filesystems, is a classic example of a tree structure with multiple links per node. This structure fits well with filesystems because the size of the B-tree node can be tuned to match closely with the size of a filesystem block or cluster.