MESSAGE
| DATE | 2015-02-25 |
| FROM | Ruben
|
| SUBJECT | Re: [LIU Comp Sci] Binary tree Excersize
|
From owner-learn-outgoing-at-mrbrklyn.com Wed Feb 25 08:16:28 2015
Return-Path:
X-Original-To: archive-at-mrbrklyn.com
Delivered-To: archive-at-mrbrklyn.com
Received: by mrbrklyn.com (Postfix)
id A73DC161167; Wed, 25 Feb 2015 08:16:28 -0500 (EST)
Delivered-To: learn-outgoing-at-mrbrklyn.com
Received: by mrbrklyn.com (Postfix, from userid 28)
id 97E15161169; Wed, 25 Feb 2015 08:16:28 -0500 (EST)
Delivered-To: learn-at-mrbrklyn.com
Received: from mail-qg0-f42.google.com (mail-qg0-f42.google.com [209.85.192.42])
by mrbrklyn.com (Postfix) with ESMTP id D0546161167
for ; Wed, 25 Feb 2015 08:16:27 -0500 (EST)
Received: by mail-qg0-f42.google.com with SMTP id z107so2813437qgd.1
for ; Wed, 25 Feb 2015 05:16:24 -0800 (PST)
X-Google-DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed;
d=1e100.net; s=20130820;
h=x-gm-message-state:message-id:date:from:user-agent:mime-version:to
:subject:references:in-reply-to:content-type
:content-transfer-encoding;
bh=MNDbOnI1HSNdGfPeHlUGFovDWIWJFklJqAqBeQfoE94=;
b=f+UcksLUEvVD/CFi+U/CGePiiR5fmJaaZm1eQhE//wbfsnsUSae7lxi67CgxTKp3Ns
IlN1Yk5wlgpmIW1sxkb5yEGGNbjVAZTfw2OojjWg4lNdYYgiYMfVSlApPTZTteUwbn/D
lKK6T+jYix2gSHnzledbc5jaKNHQt69yLKkBM+gE1Q2K520AjiJBj9D4eD+g0YJzGseD
SZY0zH1WSRouuz3VOkh7nQr6WgK2Aj/nn1v3FHH3YASXiNoKPvnl/pOUCgv7Hq+Q6tzp
TO1LoOVubmJpzIgnethZTljMRhIXjhqH8T1qgvYwn5WpuY4a7yYCE7fk5Tv4l4dtvVvy
v6SQ==
X-Gm-Message-State: ALoCoQmg0Dq59ET7WJVYNoWWM4ftP1VwEI6MOCgF06wG8gUxRyri63BdU6VZbgARavAYgI4d7VnH
X-Received: by 10.140.218.202 with SMTP id o193mr6886559qhb.13.1424870184696;
Wed, 25 Feb 2015 05:16:24 -0800 (PST)
Received: from [10.0.0.19] ([96.57.23.82])
by mx.google.com with ESMTPSA id 70sm6993573qhe.29.2015.02.25.05.16.23
for
(version=TLSv1.2 cipher=ECDHE-RSA-AES128-GCM-SHA256 bits=128/128);
Wed, 25 Feb 2015 05:16:24 -0800 (PST)
Message-ID: <54EDCB27.5080904-at-my.liu.edu>
Date: Wed, 25 Feb 2015 08:16:23 -0500
From: Ruben
User-Agent: Mozilla/5.0 (X11; Linux x86_64; rv:31.0) Gecko/20100101 Thunderbird/31.3.0
MIME-Version: 1.0
To: learn-at-mrbrklyn.com
Subject: Re: [LIU Comp Sci] Binary tree Excersize
References: <54EB4BE9.6020505-at-panix.com> <54EBF7E1.2070605-at-panix.com> <54EBFCC9.8070605-at-my.liu.edu>
In-Reply-To:
Content-Type: text/plain; charset=utf-8
Content-Transfer-Encoding: 7bit
Sender: owner-learn-at-mrbrklyn.com
Precedence: bulk
Reply-To: learn-at-mrbrklyn.com
On 02/24/2015 12:32 PM, Maneesh Kongara wrote:
> int node_count(const BinTree& node)
> > {
> > int static count = 0;
> > if(node == 0)
> > {
> > return count;
> > }
> > node_count(node->left);
> > node_count(node->right);
> > count++;
> > return count;
> > }
this is the part that was my solution for the homework.
It is the extra credit part that is worthy of discussion.
|
|
