Question: In Java, explain how to store a binary tree using an [array | linked structure]. For an array, explain how to find the child/parent of
In Java, explain how to store a binary tree using an [array | linked structure]. For an array, explain how to find the child/parent of a given node based only on the index of that element. For a linked structure, write the code for a node. Can you generalize the idea to k-ary trees?
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
