Databases
StackOverflow2013
Postsdbo
PO
 

Note that there are some explanatory texts on larger screens.

plurals
  1. PO
    primarykey
    data
    text
    <h3>Creating a binary tree in general</h3> <p>It would be easier and would create cleaner code to create a class named <code>BinaryTree</code> which will be something like this):</p> <pre><code>class Node { Node left, right; Person value; public Node(Person val) { value = val; } } public class BinaryTree { Node head; public BinaryTree() { head = null; } public void insert(Person data) { Node tmp = new Node(data); if (head == null) head = tmp; else // do comparisons with head to decide where to add the new node head-&gt;left = new Node(data); // or head-&gt;right = new Node(data); } public void traverse() { // could be similar to your printInOrder method } } </code></pre> <p>and then you could do:</p> <pre><code>... main(String[] args) { BinaryTree tree = new BinaryTree(); tree.insert(new Person(...)); tree.insert(new Person(...)); tree.traverse(); } </code></pre> <h3> Make your code work with not many changes </h3> <p>This is more on how to "work" in your already created code.</p> <p>If you want to insert <code>Person</code> instances inside a binary tree, first of all you should change:</p> <pre><code> // Node Class static class Node { Node left, right; int value; public Node(int value) { this.value = value; } } </code></pre> <p>instead of taking <code>int</code> values, to take <code>Person</code> instances, like this:</p> <pre><code> // Node Class static class Node { Node left, right; Person per; public Node(Person per) { this.per = per; } } </code></pre> <p>You should also change <code>insert</code> method to take <code>Person</code> instances, instead of <code>int</code> values. And change the comparisons <code>(value &lt; node.value)</code> to compare <code>Person</code> instances, maybe by their <code>lastName</code> or their <code>id</code> instead.</p> <p>Then inside your <code>clubmember</code> <code>main</code> code you could do:</p> <pre><code>public static void main(String[] args) { BinaryTreeTest foo; Person per1 = new Person(...); BinaryTreeTest.Node nod1 = new BinaryTreeTest.Node(per1); Person per2 = new Person(...); foo.insert(nod1, per2); </code></pre>
    singulars
    1. This table or related slice is empty.
    1. POLearning binary trees, can't figure out how to merge 2 code samples
      singulars
      1. PTQuestion
    1. PTAnswer
    1. USinsumity
    1. USinsumity
    plurals
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. POLearning binary trees, can't figure out how to merge 2 code samples
      singulars
      1. PTQuestion
    1. This table or related slice is empty.
    1. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTUpMod
    2. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTUpMod
    3. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTAcceptedByOriginator
    1. COYou should also change insert method to take Person instances, instead of int values. And change the comparisons (value < node.value) to compare Person instances, maybe by their lastName or their id instead. '''How would I do that?
      singulars
      1. PO
      1. USallencoded
    2. COLike this: `public void insert(Node node, Person value) { if (value.id < node.value.id) { if (node.left != null) { insert(node.left, value); } else { System.out.println(" Inserted " + value + " to left of " + node.value); node.left = new Node(value); } } else if (value.id > node.value.id) { if (node.right != null) { insert(node.right, value); } else { System.out.println(" Inserted " + value + " to right of " + node.value); node.right = new Node(value); } }`
      singulars
      1. PO
      1. USinsumity
    3. CO@allencoded Now `value` is a `Person` instance, so `node.value` corresponds to a `Person` `instance`, and you can read it's properites by doing `node.value.id` or `node.value.firstName` ...
      singulars
      1. PO
      1. USinsumity
 

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