Databases
StackOverflow2013
Postsdbo
POHow to create a Binary Tree from a General Tree?
 

Note that there are some explanatory texts on larger screens.

plurals
  1. POHow to create a Binary Tree from a General Tree?
    primarykey
    data
    text
    <p>I have to solve the following constructor for a BinaryTree class in java:</p> <pre><code>BinaryTree(GeneralTree&lt;T&gt; aTree) </code></pre> <p>This method should create a <strong>BinaryTree (bt)</strong> from a <strong>General Tree (gt)</strong> as follows:</p> <p>Every Vertex from <strong>gt</strong> will be represented as a leaf in <strong>bt</strong>. </p> <ul> <li>If gt is a leaf, then bt will be a leaf with the same value as gt </li> <li>If gt is not a leaf, then bt will be constructed as an empty root, a left subTree (lt) and a right subTree (lr). Lt is a stric binary tree created from the oldest subtree of gt (the left-most subtree) and lr is a stric binary tree created from gt without its left-most subtree. </li> </ul> <p>The frist part is trivial enough, but the second one is giving me some trouble. I've gotten this far:</p> <pre><code>public BinaryTree(GeneralTree&lt;T&gt; aTree){ if (aTree.isLeaf()){ root= new BinaryNode&lt;T&gt;(aTree.getRootData()); }else{ root= new BinaryNode&lt;T&gt;(null); // empty root LinkedList&lt;GeneralTree&lt;T&gt;&gt; childs = aTree.getChilds(); // Childs of the GT are implemented as a LinkedList of SubTrees child.begin(); //start iteration trough list BinaryTree&lt;T&gt; lt = new BinaryTree&lt;T&gt;(childs.element(0)); // first element = left-most child this.addLeftChild(lt); aTree.DeleteChild(hijos.elemento(0)); BinaryTree&lt;T&gt; lr = new BinaryTree&lt;T&gt;(aTree); this.addRightChild(lr); } } </code></pre> <p>Is this the right way? If not, can you think of a better way to solve this? This solution, for example, gives me a bunch of nodes with no data at all, I don't know if this is an issue of the problem itself or mine.</p> <p>Thank you!</p>
    singulars
    1. PO
      singulars
      1. PTAnswer
    1. This table or related slice is empty.
    1. PTQuestion
    1. USjlasarte
    1. USjlasarte
    plurals
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. PO
      singulars
      1. PTAnswer
    2. PO
      singulars
      1. PTAnswer
    1. VO
      singulars
      1. POHow to create a Binary Tree from a General Tree?
      1. This table or related slice is empty.
      1. VTUpMod
    2. VO
      singulars
      1. POHow to create a Binary Tree from a General Tree?
      1. This table or related slice is empty.
      1. VTUpMod
    3. VO
      singulars
      1. POHow to create a Binary Tree from a General Tree?
      1. This table or related slice is empty.
      1. VTUpMod
    1. COCan you elaborate on "giving me some troubles" means?
      singulars
      1. POHow to create a Binary Tree from a General Tree?
      1. USmatt b
    2. COHey matt, thanks for answering. "Giving me some trouble" may not have been the best way to put it, maybe? I just meant that I'm not sure if this is the best way to go about solving the problem. It's the best way I found, but it has some issues, e.g the Binary Tree could end up with a bunch on nodes with no data, and that, I think, may not be so great?
      singulars
      1. POHow to create a Binary Tree from a General Tree?
      1. USjlasarte
    3. COIs a node in GeneralTree allowed to have more than two children? If so, how do you deal with this in your b-tree?
      singulars
      1. POHow to create a Binary Tree from a General Tree?
      1. USmatt b
 

Querying!

 
Guidance
A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload