Scientific Research An Academic Publisher
OPEN ACCESS
Add your e-mail address to receive free newsletters from SCIRP.
Select Journal AA AAD AAR AASoci AAST ABB ABC ABCR ACES ACS ACT AD ADR AE AER AHS AID AiM AIT AJAC AJC AJCC AJCM AJIBM AJMB AJOR AJPS ALAMT ALC ALS AM AMI AMPC ANP APD APE APM ARS ARSci AS ASM BLR CC CE CellBio ChnStd CM CMB CN CRCM CS CSTA CUS CWEEE Detection EMAE ENG EPE ETSN FMAR FNS GEP GIS GM Graphene GSC Health IB ICA IIM IJAA IJAMSC IJCCE IJCM IJCNS IJG IJIDS IJIS IJMNTA IJMPCERO IJNM IJOC IJOHNS InfraMatics JACEN JAMP JASMI JBBS JBCPR JBiSE JBM JBNB JBPC JCC JCDSA JCPT JCT JDAIP JDM JEAS JECTC JEMAA JEP JFCMV JFRM JGIS JHEPGC JHRSS JIBTVA JILSA JIS JMF JMGBND JMMCE JMP JPEE JQIS JSBS JSEA JSEMAT JSIP JSS JSSM JST JTR JTST JTTs JWARP LCE MC ME MI MME MNSMS MPS MR MRC MRI MSA MSCE NJGC NM NR NS OALib OALibJ ODEM OJA OJAB OJAcct OJAnes OJAP OJApo OJAppS OJAPr OJAS OJBD OJBIPHY OJBM OJC OJCB OJCD OJCE OJCM OJD OJDer OJDM OJE OJEE OJEM OJEMD OJEpi OJER OJF OJFD OJG OJGas OJGen OJI OJIC OJIM OJINM OJL OJM OJMC OJMetal OJMH OJMI OJMIP OJML OJMM OJMN OJMP OJMS OJMSi OJN OJNeph OJO OJOG OJOGas OJOp OJOph OJOPM OJOTS OJPathology OJPC OJPChem OJPed OJPM OJPP OJPS OJPsych OJRA OJRad OJRD OJRM OJS OJSS OJSST OJST OJSTA OJTR OJTS OJU OJVM OPJ POS PP PST PSYCH SAR SCD SGRE SM SN SNL Soft SS TEL TI UOAJ VP WET WJA WJCD WJCMP WJCS WJET WJM WJNS WJNSE WJNST WJV WSN YM
More>>
Song, S. (2008) Trees and Binary Trees. https://www.ime.usp.br/~song/mac5710/slides/05tree
has been cited by the following article:
TITLE: Heru Search Method—Unique in the World that Uses Unprecedented Mathematical Formulas and Replaces the Binary Tree Breaking Various Paradigms Like 0(logn)
AUTHORS: Carlos Roberto França
KEYWORDS: Search Method, B-Tree, Innovations in Database, Infinite Series
JOURNAL NAME: American Journal of Computational Mathematics, Vol.7 No.1, March 31, 2017
ABSTRACT: This paper deals with the efficiency of the search, with a method of organization and storage of the information that allows better results than the research trees or binary trees. No one ever dared to present better results than 0(log n) complexity, and when they wish to improve, they use balanced trees, but they continue to use principles that do not impact the pre-semantic information treatment. The Heru search method has as main characteristic the total or partial substitution of the use of the binary trees, enabling the elimination of the approximate results and informing the user the desired information instead of occurrences by sampling outside the desired information. The breakdown of the 0(log n) paradigm and the refinement of the searches are achieved with the use of a set of unpublished mathematical formulas and concepts called Infinite Series with Multiple Ratios.
Related Articles:
Independence Numbers in Trees
Min-Jen Jou, Jenq-Jong Lin
DOI: 10.4236/ojdm.2015.53003 4,185 Downloads 4,814 Views Citations
Pub. Date: July 17, 2015
Vertex-Neighbor-Scattering Number Of Trees
Zongtian Wei, Yong Liu, Anchan Mai
DOI: 10.4236/apm.2011.14029 3,896 Downloads 7,941 Views Citations
Pub. Date: July 26, 2011
Modeling of Growth Kinetics of Conifer Trees
Alexander S. Kholmanskiy
DOI: 10.4236/ojf.2015.51003 2,536 Downloads 3,006 Views Citations
Pub. Date: January 12, 2015
On Embedding of m-Sequential k-ary Trees into Hypercubes
Indra Rajasingh, Bharati Rajan, Ramanathan Sundara Rajan
DOI: 10.4236/am.2010.16065 5,242 Downloads 9,286 Views Citations
Pub. Date: December 27, 2010
Further Results on Pair Sum Labeling of Trees
Raja Ponraj, Jeyaraj Vijaya Xavier Parthipan
DOI: 10.4236/am.2011.210177 4,222 Downloads 7,213 Views Citations
Pub. Date: October 14, 2011
