question on binary search tree

$10-30 USD

Fechado

Publicado

há aproximadamente 8 anos

$10-30 USD

Pago na entrega

write a Boolean function that is given a binary tree and returns true and only if an even number of nodes. An empty tree is considered to have an even number of nodes: The function should have just one argument, a pointer to the root. No global variables may be used. No additional functions may be defined. You may not count the number of nodes.

Data Processing

ID do Projeto: 10491463

Sobre o projeto

7 propostas

Projeto remoto

Ativo há 8 anos

Quer ganhar algum dinheiro?

Endereço de e-mail

Benefícios de ofertar no Freelancer

Defina seu orçamento e seu prazo

Seja pago pelo seu trabalho

Descreva sua proposta

É grátis para se inscrever e fazer ofertas em trabalhos

7 freelancers estão ofertando em média $57 USD for esse trabalho

@saminatinny

A proposal has not yet been provided

$111 USD em 3 dias

5,0

(12 avaliações)

3,8

@AxriKhan

I am good at this, just give me a chance.

$55 USD em 2 dias

0,0

(0 avaliações)

0,0

@ziombski

I can solve your problem within 1 day. Quickly and well. I have a lot of experience with C++ and algorithms. I have recently graduated from the second-best IT university in Europe (University of Warsaw).

$30 USD em 1 dia

0,0

(0 avaliações)

0,0

@rla56f15eff2d928

i like for data entry. i have 5 years experience with data entry. i can typing 25 words in one minutes. i have micro soft office diploma thanks.

$15 USD em 1 dia

0,0

(0 avaliações)

0,0

@sourabh46

Hi, I am able to write a Boolean function that takes a binary tree as input (pointer to the root) and returns true if there are even number of nodes. If you believe I am the right candidate for this project, please contact me soon! Thanks, Sourabh

$150 USD em 3 dias