SophiaPretty

(5)

$14/per page/Negotiable

About SophiaPretty

Levels Tought:
Elementary,Middle School,High School,College,University,PHD

Expertise:
Accounting,Algebra See all
Accounting,Algebra,Applied Sciences,Architecture and Design,Art & Design,Biology,Business & Finance,Calculus,Chemistry,Communications,Computer Science,Economics,Engineering,English,Environmental science,Essay writing Hide all
Teaching Since: Jul 2017
Last Sign in: 304 Weeks Ago, 1 Day Ago
Questions Answered: 15833
Tutorials Posted: 15827

Education

  • MBA,PHD, Juris Doctor
    Strayer,Devery,Harvard University
    Mar-1995 - Mar-2002

Experience

  • Manager Planning
    WalMart
    Mar-2001 - Feb-2009

Category > Computer Science Posted 13 Dec 2017 My Price 6.00

implementing following question in a form of pseudo-code

Hi,

 

I need help in implementing following question in a form of pseudo-code or in a language of c++, java, or python:

 "Two binary trees T1 and T2 are said to be isomorphic if one of the following holds: 

  • Both T1 and T2 consist of a single node.
  • Both T1 and T2 have the same number k of subtrees, and the ith subtree of T1 is isomorphic to the ith subtree of T2 , for i = 1,..,k.

Design an algorithm that tests whether two given binary trees are isomorphic. What is the running time of your algorithm?"

 

Thank you for your help

Answers

SophiaPretty
(5)
Status NEW Posted 13 Dec 2017 09:12 AM My Price 6.00

-----------  ----------- H-----------ell-----------o S-----------ir/-----------Mad-----------am ----------- Th-----------ank----------- yo-----------u f-----------or -----------you-----------r i-----------nte-----------res-----------t a-----------nd -----------buy-----------ing----------- my----------- po-----------ste-----------d s-----------olu-----------tio-----------n. -----------Ple-----------ase----------- pi-----------ng -----------me -----------on -----------cha-----------t I----------- am----------- on-----------lin-----------e o-----------r i-----------nbo-----------x m-----------e a----------- me-----------ssa-----------ge -----------I w-----------ill----------- be----------- qu-----------ick-----------ly

Not Rated(0)