Title: A characterization of binary search networks
Abstract: In this paper some properties of binary search networks are studied. The binary search networks constitute an extension of the binary search trees and, as a result, their performance depends on their size. This paper is particulary concerned with a subset of the binary search networks, called vertically convex binary search networks. We give a coded representation of them which allows us to determine the number, the average number of columns and the average right width of such binary search networks having a predetermined area. We also introduce two algorithms to calculate the height and left width of a vertically convex binary search network by means of a linear scanning of its codifying word.
Publication Year: 1991
Publication Date: 1991-01-01
Language: en
Type: book-chapter
Indexed In: ['crossref']
Access and Citation
Cited By Count: 4
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot