Databases
StackOverflow2013
Postsdbo
PO
 

Note that there are some explanatory texts on larger screens.

plurals
  1. PO
    primarykey
    data
    text
    <p>@Vlion:<br> It should be a pointer to the left/right/root pointers (i.e. a double pointer), so the posted code is correct, although somewhat unclear.</p> <p>@Doug:<br> Consider changing your insert function thus:</p> <pre><code>template &lt;class T&gt; void BT&lt;T&gt;::insert(struct Node&lt;T&gt;** root, struct Node&lt;T&gt;* newNode) { if (*root == NULL) { cout &lt;&lt; "Root Found" &lt;&lt; newNode-&gt;data &lt;&lt; endl; *root = newNode; } </code></pre> <p>It makes clear your intention that you'll be changing the pointer passed as the first parameter (or rather, the pointer whose address will be passed as the first parameter.) It will help avoid confusion such as the one that just happened.</p> <p>The calls to this insert(), such as:</p> <pre><code>insert(&amp;root, newNode); </code></pre> <p>will also reflect your intention of changing the pointer's value. This is a matter of style, though, so I can't argue if you don't want to change.</p> <hr> <p>As for checking whether the tree is "correct," why not draw it out and see for yourself? Something along the lines of:</p> <pre><code>template class&lt;T&gt; void printTree(struct Node&lt;T&gt;* node, int level=0) { if (!node) { for (int i=0; i&lt;level; ++i) cout &lt;&lt; " "; cout &lt;&lt; "NULL" &lt;&lt; endl; return; } printTree(node-&gt;left, level+1); for (int i=0; i&lt;level; ++i) cout &lt;&lt; " "; cout &lt;&lt; node-&gt;data &lt;&lt; endl; printTree(node-&gt;right, level+1); } </code></pre> <p>(Untested code)</p>
    singulars
    1. This table or related slice is empty.
    1. POC++ Binary Search Tree Insert via Recursion
      singulars
      1. PTQuestion
    1. PTAnswer
    1. This table or related slice is empty.
    1. USaib
    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. This table or related slice is empty.
    1. This table or related slice is empty.
    1. COThanks for the help. So I'll try changeing it around like you said, but technically our code is doing the same things though right?
      singulars
      1. PO
      1. USDoug
    2. COI also forgot to add that while I didn't go as far as you did in making a function to drawing out the tree, Based on the debug prints, and my own drawing of the pre defined hard coded numbers that are inserted.. It appears to be doing it correctly. I sent it off to my TA in hopes he can clarify.
      singulars
      1. PO
      1. USDoug
    3. COYes, they both are doing the same thing; the difference is cosmetic. The code looks correct, the problem is (as Martin York has pointed out) printing "root found" while the node is actually just the root of the new subtree. (i.e. a leaf)
      singulars
      1. PO
      1. USaib
 

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