Is this 2-3 tree correct?











up vote
-1
down vote

favorite












I am helping a student in some material that I am not that familiar with. We are to make a 2-3 tree out of the word COMPUTING using alphabetical order.



Is this correct?



                         [m]
[g] [p]
[c][i] [n,o] [t,u]


assuming edges from [m] to [g] and [p]
edges from [g] to [c] and [i]
edges from [p] to [n,o] and [t,u]










share|cite|improve this question






















  • Please tell me why it was marked down. Seems pretty obvious that you should explain the down vote?
    – tmpys
    Nov 13 at 21:16










  • I think this would be more appropriate on the computer science stack exchange site. I wasn't the downvote, though.
    – Kevin Long
    Nov 13 at 21:22

















up vote
-1
down vote

favorite












I am helping a student in some material that I am not that familiar with. We are to make a 2-3 tree out of the word COMPUTING using alphabetical order.



Is this correct?



                         [m]
[g] [p]
[c][i] [n,o] [t,u]


assuming edges from [m] to [g] and [p]
edges from [g] to [c] and [i]
edges from [p] to [n,o] and [t,u]










share|cite|improve this question






















  • Please tell me why it was marked down. Seems pretty obvious that you should explain the down vote?
    – tmpys
    Nov 13 at 21:16










  • I think this would be more appropriate on the computer science stack exchange site. I wasn't the downvote, though.
    – Kevin Long
    Nov 13 at 21:22















up vote
-1
down vote

favorite









up vote
-1
down vote

favorite











I am helping a student in some material that I am not that familiar with. We are to make a 2-3 tree out of the word COMPUTING using alphabetical order.



Is this correct?



                         [m]
[g] [p]
[c][i] [n,o] [t,u]


assuming edges from [m] to [g] and [p]
edges from [g] to [c] and [i]
edges from [p] to [n,o] and [t,u]










share|cite|improve this question













I am helping a student in some material that I am not that familiar with. We are to make a 2-3 tree out of the word COMPUTING using alphabetical order.



Is this correct?



                         [m]
[g] [p]
[c][i] [n,o] [t,u]


assuming edges from [m] to [g] and [p]
edges from [g] to [c] and [i]
edges from [p] to [n,o] and [t,u]







trees






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Nov 13 at 20:57









tmpys

480516




480516












  • Please tell me why it was marked down. Seems pretty obvious that you should explain the down vote?
    – tmpys
    Nov 13 at 21:16










  • I think this would be more appropriate on the computer science stack exchange site. I wasn't the downvote, though.
    – Kevin Long
    Nov 13 at 21:22




















  • Please tell me why it was marked down. Seems pretty obvious that you should explain the down vote?
    – tmpys
    Nov 13 at 21:16










  • I think this would be more appropriate on the computer science stack exchange site. I wasn't the downvote, though.
    – Kevin Long
    Nov 13 at 21:22


















Please tell me why it was marked down. Seems pretty obvious that you should explain the down vote?
– tmpys
Nov 13 at 21:16




Please tell me why it was marked down. Seems pretty obvious that you should explain the down vote?
– tmpys
Nov 13 at 21:16












I think this would be more appropriate on the computer science stack exchange site. I wasn't the downvote, though.
– Kevin Long
Nov 13 at 21:22






I think this would be more appropriate on the computer science stack exchange site. I wasn't the downvote, though.
– Kevin Long
Nov 13 at 21:22

















active

oldest

votes











Your Answer





StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");

StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});

function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});


}
});














 

draft saved


draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2997327%2fis-this-2-3-tree-correct%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown






























active

oldest

votes













active

oldest

votes









active

oldest

votes






active

oldest

votes
















 

draft saved


draft discarded



















































 


draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2997327%2fis-this-2-3-tree-correct%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown





















































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown

































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown







Popular posts from this blog

How to send String Array data to Server using php in android

Title Spacing in Bjornstrup Chapter, Removing Chapter Number From Contents

Is anime1.com a legal site for watching anime?