height « tree « Java Collection Q&A

1. Height of 2-3-4 tree    stackoverflow.com

I have a working snippet to use for a regular tree comprising nodes. Now I just need to fiddle with it to work for 2-3-4 trees, which should be easier, since ...

2. Height of a binary tree    stackoverflow.com

Consider the following code:

public int heightOfBinaryTree(Node node)
{
    if (node == null)
    {
        return 0;
    }
 ...

3. Are my recursion conditions right to compute binary tree height?    stackoverflow.com

I'm trying to know whether my code is right or wrong with your help, because sadly I can't run it to check. There are no compile errors. What I'm trying to ...

4. how to get height ot a Dynamic binary Tree    coderanch.com

5. how to get height of a BFS tree    java-forums.org

6. Help with Binary Search tree height method please.    forums.oracle.com

No this wasn't specified and so I noticed I was missing that thanks for pointing it out.. method seems to work now. Having troubles with the depth one now.. i just don't understand how to set it up recursively... to calculate the depth of the BST shouldn't I just have to call the method to go left and right over and ...

7. Getting the height of a binary tree    forums.oracle.com

8. Having trouble finding the height of a Binary Tree    forums.oracle.com

With a recursive height function so simple, I'm pretty sure mine is correct. I must have a problem in the add() method that is placing my nodes in the wrong place, giving me a height of 9 instead of a height of 5 as its supposed to be. Does anyone see any problem in my add method?

9. Calculate Tree height.    forums.oracle.com

I have some idea here. I am trying to code it in. I am traversing the tree as edward suggested. Here's what I think I should do : - Initialize height to 0, numberOfBranches to 0. - Start traversing from the node. - If root has no children, return height as 0. - Else starting with one of root's children, start ...

10. Height of Binary Search Tree    forums.oracle.com

Tracking the height as I insert seems like an easy alternative, but i must write a stand-alone method which doesn't depend on any other. I have a vague idea of how to do it: I have to ints, one which carries the temporal height (let's say h) and the other which has the maximum height (mh). I start going down, always ...

11. Binary Tree - help making a tree with max height.    forums.oracle.com

12. height method in binary search tree    forums.oracle.com