Home| Contact Us| New Journals| Browse Journals| Journal Prices| For Authors|

Print ISSN: 0976-898X
Online ISSN:
0976-8998


  About JITR
  DLINE Portal Home
Home
Aims & Scope
Editorial Board
Current Issue
Next Issue
Previous Issue
Sample Issue
Upcoming Conferences
Self-archiving policy
Alert Services
Be a Reviewer
Publisher
Paper Submission
Subscription
Contact us
 
  How To Order
  Order Online
Price Information
Request for Complimentary
Print Copy
 
  For Authors
  Guidelines for Contributors
Online Submission
Call for Papers
Author Rights
 
 
RELATED JOURNALS
Journal of Digital Information Management (JDIM)
International Journal of Computational Linguistics Research (IJCL)
International Journal of Web Application (IJWA)

 

 
Journal of Information Technology Review
 

The Single Direction Edges in the Binary Tree
Adrijan Bozinovski
School of Computer Science and Information Technology at University American College Skopje 1000 Skopje, Macedonia
Abstract: Using the complete binary tree, we have introduced a generalized data structure and named it as Leveled binary tree. We do maintain the single direction during inserting nodes in the levelled tree, leads to the single direction edges in the binary tree. We observed that regularities are formalized using mathematical formulae, which are presented and proved, and it is shown how they produce specific integer sequences which can be expanded to infinity. The findings seem to generate further interest in this direction.
Keywords: Leveled Binary Tree, Single-Direction Edges, Minimum, Maximum, Integer Sequence, Online Encyclopedia of Integer Sequences The Single Direction Edges in the Binary Tree
DOI:https://doi.org/10.6025/jitr/2021/12/1/8-12
Full_Text   PDF 223 KB   Download:   261  times
References:

[1] Sedgewick, R. (1998). Algorithms in C++, Parts 1-4: Fundamentals, Data Structures, Sorting, Searching, 3rd ed, Addison Wesley.
[2] Kreher, D. L., Stinson, D. R. (1998). Combinatorial Algorithms: Generation, Enumeration, and Search, Discrete Math ematics and its Applications (Book 7), CRC Press, 1st Edition, 1998.
[3] Brassard, G., Bratley, P. (2002). Fundamentals of Algorithmics, Prentice Hall of India, 2002.
[4] Bozinovski, A., Bozinovski, S. (2004). N-Queens Pattern Generation: An Insight into Space Complexity of a Backtracking Algorithm, Proc. 3rd Int. Symp. Information and Communication Technologies, Las Vegas, Nevada, USA, 281- 286, 2004.
[5] Rich, E. (1983). Artificial Intelligence, McGraw-Hill series in artificial intelligence, McGraw-Hill Inc., 1983.
[6] Suh, I., Headrick, T. C. (2010). A Comparative Analysis of the Bootstrap Versus Traditional Statistical Procedures Applied to Digital Analysis Based on Benford’s Law, J. Forensic and Investigative Accounting, 2 (2), p 144-175, 2010.
[7] Buchmann, J., Dahmen, E., Klintsevich, E., Okeya, K., Vuillaume, C. (2007). Merkle Signatures with Virtually Unlimited Signature Capacity, In: Proceedings 5th Int. Conf. Applied Cryptography and Network Security, Zhuhai, China, p 31-45, 2007.
[8] Katz, J. (2003). Binary Tree Encryption: Constructions and Applications, Information Security and Cryptology (ICISC 2003), vol. 2971, Lecture Notes in Computer Science, p 1-11, Springer, 2003.
[9] Cormen, T. H., Leiserson, C. E., Rivest, R. L., Stein, C. (2009). Introduction to Algorithms, 3rd ed., The MIT Press, 2009.
[10] Adel’son-Vel’skii, G. M., Landis, E.M. (1962). An Algorithm for the Organization of Information, Soviet Math. Doklady, vol. 3, p 1259-1263, 1962.
[11] Bayer, R., McCreight. (1972). Organization and Maintenance or Large Oriented Indexes, Acta Inform., 3 (3), p173- 189, 1972.
[12] Roch, S., Steel, M. (2014). Likelihood-Based Tree Reconstruction on a Concatenation of Alignments can be Statistically Inconsistent, Theor. Popul. Biol., vol. 100, p 56-62, 2014.
[13] Li, Y., Xu, M., Zhao, H., Huang, W. (2016). Hierarchical Fuzzy Entropy and Improved Support Vector Machine Based Binary Tree Approach for Rolling Bearing Fault Diagnosis, Mech. Mach. Theory, vol. 98, p 114-132, 2016.
[14] Liu, B., Shen, Y., Chen, X., Chen, Y., Wang, X. (2014). A partial binary tree DEA-DA cyclic classification model for decision makers in complex multi-attribute large-group interval-valued intuitionistic fuzzy decision-making problems, Inf. Fusion, vol. 18, p 119-130.
[15] Lee, Y., Lee, J. (2015). Binary tree optimization using genetic algorithm for multiclass support vector machine, Expert Syst. Appl, 42 (8), p 3843-3851, 2015.
[16] Amani, M., Lai, K.A., Tarjan. R. E. (2016). Amortized rotation cost in AVL trees, Inf. Process. Lett., 98 (5), p 327-330, 2016.
[17] Goodrich, M.T., Tamassia, R., Goldwasser, M. H. (2014). Data Sructures and Algorithms in Java, 6th ed., Wiley, 2014.
[18] Horowitz, E., Sahni, S. (1983). Fundamentals of Data Structures. Computer Science Press, 1983.
[19] Bozinovski, A., Tanev, G. (2016). Sequence A277267 in the On-Line Encyclopedia of Integer Sequences, 2016, (accessed October 13, 2016) Available from: https://oeis.org/A277267.
[20] Bozinovski, A. (2016). Sequence A279521 in the On-Line Encyclopedia of Integer Sequences, 2016, (accessed December 23, 2016) Available from: https://oeis.org/A279521.


Home | Aim & Scope | Editorial Board | Author Guidelines | Publisher | Subscription | Previous Issue | Contact Us |Upcoming Conferences|Sample Issues|Library Recommendation Form|

 

Copyright © 2011 dline.info