Method that returns “alpha” node in an AVL tree
I wrote a method that updates the balance factor of a particular node, but I'm not sure how to find alpha, the deepest node where an imbalance occurs (since multiple nodes may be imbalanced when an insertion occurs). I feel like the method is simple, like it would find all the imbalanced nodes and choose the one with the least height, therefore greatest depth, but I'm not sure how to write this.
Here is my method that updates the balance factor (also height) of a node:
private void update(BSTNode node){
int leftHeight = (node.left == null) ? -1 : height(node.left);
int rightHeight = (node.right == null) ? -1 : height(node.right);
//update node's height
node.height = 1 + Math.max(leftHeight, rightHeight);
//update balance factor
node.bf = rightHeight - leftHeight;
}
Any help is appreciated.
binary-search-tree nodes avl-tree
asked Nov 14 '18 at 0:49
Alan NavaiAlan Navai
164
add a comment |
I wrote a method that updates the balance factor of a particular node, but I'm not sure how to find alpha, the deepest node where an imbalance occurs (since multiple nodes may be imbalanced when an insertion occurs). I feel like the method is simple, like it would find all the imbalanced nodes and choose the one with the least height, therefore greatest depth, but I'm not sure how to write this.
Here is my method that updates the balance factor (also height) of a node:
private void update(BSTNode node){
int leftHeight = (node.left == null) ? -1 : height(node.left);
int rightHeight = (node.right == null) ? -1 : height(node.right);
//update node's height
node.height = 1 + Math.max(leftHeight, rightHeight);
//update balance factor
node.bf = rightHeight - leftHeight;
}
Any help is appreciated.
binary-search-tree nodes avl-tree
asked Nov 14 '18 at 0:49
Alan NavaiAlan Navai
164
add a comment |
I wrote a method that updates the balance factor of a particular node, but I'm not sure how to find alpha, the deepest node where an imbalance occurs (since multiple nodes may be imbalanced when an insertion occurs). I feel like the method is simple, like it would find all the imbalanced nodes and choose the one with the least height, therefore greatest depth, but I'm not sure how to write this.
Here is my method that updates the balance factor (also height) of a node:
private void update(BSTNode node){
int leftHeight = (node.left == null) ? -1 : height(node.left);
int rightHeight = (node.right == null) ? -1 : height(node.right);
//update node's height
node.height = 1 + Math.max(leftHeight, rightHeight);
//update balance factor
node.bf = rightHeight - leftHeight;
}
Any help is appreciated.
binary-search-tree nodes avl-tree
asked Nov 14 '18 at 0:49
Alan NavaiAlan Navai
164
I wrote a method that updates the balance factor of a particular node, but I'm not sure how to find alpha, the deepest node where an imbalance occurs (since multiple nodes may be imbalanced when an insertion occurs). I feel like the method is simple, like it would find all the imbalanced nodes and choose the one with the least height, therefore greatest depth, but I'm not sure how to write this.
Here is my method that updates the balance factor (also height) of a node:
private void update(BSTNode node){
int leftHeight = (node.left == null) ? -1 : height(node.left);
int rightHeight = (node.right == null) ? -1 : height(node.right);
//update node's height
node.height = 1 + Math.max(leftHeight, rightHeight);
//update balance factor
node.bf = rightHeight - leftHeight;
}
Any help is appreciated.
binary-search-tree nodes avl-tree
binary-search-tree nodes avl-tree
asked Nov 14 '18 at 0:49
Alan NavaiAlan Navai
164
asked Nov 14 '18 at 0:49
Alan NavaiAlan Navai
164
asked Nov 14 '18 at 0:49
Alan NavaiAlan Navai
164
asked Nov 14 '18 at 0:49
Alan NavaiAlan Navai
164
asked Nov 14 '18 at 0:49
Alan NavaiAlan Navai
164
164
add a comment |
add a comment |
0
active
oldest
votes
Your Answer
StackExchange.ifUsing("editor", function () {
StackExchange.using("externalEditor", function () {
StackExchange.using("snippets", function () {
StackExchange.snippets.init();
});
});
}, "code-snippets");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "1"
};
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',
autoActivateHeartbeat: false,
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
},
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53291612%2fmethod-that-returns-alpha-node-in-an-avl-tree%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
Thanks for contributing an answer to Stack Overflow!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53291612%2fmethod-that-returns-alpha-node-in-an-avl-tree%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
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
