• Dec 24, 2021 News!Vol 10, No 1- Vol 10, No 2 has been indexed by IET-(Inspec)   [Click]
  • Aug 27, 2020 News!Welcome Prof. D. P. Sharma from India to join the Editorial board of IJFCC     [Click]
  • Aug 18, 2022 News!Vol.11, No.3 has been published with online version.     [Click]
General Information
Editor-in-chief

Prof. Pascal Lorenz
University of Haute Alsace, France
 
It is my honor to be the editor-in-chief of IJFCC. The journal publishes good papers in the field of future computer and communication. Hopefully, IJFCC will become a recognized journal among the readers in the filed of future computer and communication.

IJFCC 2015 Vol.4(1): 63-66 ISSN: 2010-3751
DOI: 10.7763/IJFCC.2015.V4.357

A Simple Dynamic Programming Algorithm for Counting Red Nodes in Red-Black Trees

Daxin Zhu, Xiaodong Wang, and Jun Tian
Abstract—In this paper, we are interested in the number of red nodes in red-black trees. We first present an O(n2log n) time dynamic programming solution for computing r(n), the largest number of red internal nodes in a red-black tree on n keys. Then the algorithm is improved to a new O(n) time algorithm. Based on the structure of the solution we finally present a linear time recursive algorithm using only O(log n) space.

Index Terms—Red-black trees, red internal nodes, dynamic programming, linear time solution.

Daxin Zhu is with Quanzhou Normal University, Quanzhou, China (e-mail: dex@qztc.edu.cn).
Xiaodong Wang and Jun Tian are with Fujian University of Technology, Fuzhou, China (e-mail:wangxd135@139.com, tianjunfjmu@126.com).

[PDF]

Cite: Daxin Zhu, Xiaodong Wang, and Jun Tian, "A Simple Dynamic Programming Algorithm for Counting Red Nodes in Red-Black Trees," International Journal of Future Computer and Communication vol. 4, no. 1, pp. 63-66, 2015.

Copyright © 2008-2022. International Journal of Future Computer and Communication. All rights reserved.
E-mail: ijfcc@ejournal.net