Thread: ordered binary tree

  1. #1
    Registered User
    Join Date
    Jul 2005

    ordered binary tree

    Hi developers,

    I only wanne know: Is this solution right?


    I have to write a function wich returns
    the largest key (node->key == Max) in an ordered binary tree.

    int Maxkey(const node*)
    I must do it on brute force (so easiest ) way.

    Struct node {
    Int key;
    	Struct node *left, *right;

    I have developted the code. Can someone look at it if it's right(good).

    My sollution:
    int Maxkey( const node *n) {
         int max=o;
         if (n == NULL) 
         else  while (n->right != NULL)  {
                        if (max > n->key)
                               max = n->key;
         return max;
    Is this code ok??
    Thanx people


  2. #2
    ATH0 quzah's Avatar
    Join Date
    Oct 2001
    Why don't you just write a test case to see if it gives you the right answer? If you're even getting this to compile, and actually calling the function, then you have a tree. Does it give you the answer you expect? Even when you switch the order of the information in the nodes? If so, then it's probably working right. If not, fix it.

    Hope is the first step on the road to disappointment.

  3. #3
    Registered User
    Join Date
    Jul 2005
    well I wrote my test case. For me it's right.
    I ask a second opinion???


  4. #4
    Code Goddess Prelude's Avatar
    Join Date
    Sep 2001
    >I ask a second opinion???
    It's overkill. You can simply rely on the structure of a binary search tree to give you the correct value:
    int MaxKey ( const node *root )
      assert ( root != NULL );
      while ( root->right != NULL )
        root = root->right;
      return root->key;
    >Struct node {
    C is case sensitive, the keyword is struct, not Struct.

    >Int key;
    Ditto, int, not Int.

    >int Maxkey( const node *n) {
    Unless you've tyepdef'd the node structure, you need to specify the keyword struct when declaring an instance.

    >int max=o;
    What's o? Did you mean 0?

    Return what? If you say you're going to return a value, you'd better return a value.

    >if (max > n->key)
    This test is redundant, and incorrect. If max is greater than n->key, and you're looking for the largest value in the tree, why do you set max to n->key?

    This doesn't do anything. Try assigning this to n and you'll have better results.
    My best code is written with the delete key.

Popular pages Recent additions subscribe to a feed

Similar Threads

  1. Replies: 0
    Last Post: 11-04-2006, 11:07 AM
  2. Binary Search Trees Part III
    By Prelude in forum A Brief History of
    Replies: 16
    Last Post: 10-02-2004, 03:00 PM
  3. Tutorial review
    By Prelude in forum A Brief History of
    Replies: 11
    Last Post: 03-22-2004, 09:40 PM
  4. Request for comments
    By Prelude in forum A Brief History of
    Replies: 15
    Last Post: 01-02-2004, 10:33 AM
  5. BST/Red and Black Tree
    By ghettoman in forum C++ Programming
    Replies: 0
    Last Post: 10-24-2001, 10:45 PM