Click for new scientific resources and news about Corona[COVID-19]

Paper Information

Journal:   AMIRKABIR   Fall 2003 , Volume 14 , Number 56-C; Page(s) 270 To 276.
 
Paper: 

GENERATING BINARY TREES IN B-ORDER AND BALLOT-ORDER

 
 
Author(s):  AHRABIAN H., NOUZARI DALINI ABAS
 
* 
 
Abstract: 

We use two recent codings of binary trees by integer sequences called P-sequences and Ballot-sequences in order to generate binary trees in B-order and Ballot-order. These algorithms generate; each sequence in constant average time O(1). The ranking and unranking algorithms for both sequences with O (n2) time complexity are described

 
Keyword(s): BINARY TREE, RECURSION, B-ORDER, P-SEQUENCES, BALLOT-SEQUENCES.C. R. CATEGORIES: G.2.1 COMBINATORIAL ALGORITHM, G.2.2 GRAPH THEORY (TREES)
 
 
References: 
  • ندارد
  •  
 
Click to Cite.
APA: Copy

AHRABIAN, H., & NOUZARI DALINI, A. (2003). GENERATING BINARY TREES IN B-ORDER AND BALLOT-ORDER. AMIRKABIR, 14(56-C), 270-276. https://www.sid.ir/en/journal/ViewPaper.aspx?id=2387



Vancouver: Copy

AHRABIAN H., NOUZARI DALINI ABAS. GENERATING BINARY TREES IN B-ORDER AND BALLOT-ORDER. AMIRKABIR. 2003 [cited 2021May14];14(56-C):270-276. Available from: https://www.sid.ir/en/journal/ViewPaper.aspx?id=2387



IEEE: Copy

AHRABIAN, H., NOUZARI DALINI, A., 2003. GENERATING BINARY TREES IN B-ORDER AND BALLOT-ORDER. AMIRKABIR, [online] 14(56-C), pp.270-276. Available: https://www.sid.ir/en/journal/ViewPaper.aspx?id=2387.



 
 
Yearly Visit 34
 
Latest on Blog
Enter SID Blog