A Survey on Maintaining Binary Search Tree in Optimal Shape

Inayat-Ur-Rehman,; Khan, Saif Ur Rehman; Khayal, M. Sikandar Hayat

doi:10.1109/icime.2009.128

Search citation statements

Order By: Relevance

Paper Sections

Select...

A Comparison On Searching Performance1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2012

2021

Publication Types

Select...

Other2

Article1

Relationship

Self Cite0

Independent3

Authors

Journals

Cited by 3 publications

(1 citation statement)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It results in optimal performance for the end-user. The construction of a binary tree protrudes from the root node [11]. The tree has the best picture once it is portrayed in the hierarchy of parent-child with a single character as a parent node (root node).…”

Section: A Comparison On Searching Performancementioning

confidence: 99%

A Succinct Novel Searching Algorithm

Céline¹,

Robert²

2021

IJACSA

View full text Add to dashboard Cite

A searching algorithm was found to be effective in producing acutely needed results in the operation of data structures. Searching is being performed as a common operation unlike other operations in various formats of algorithms. The binary and linear search book a room in most of the searching techniques. Going with each technique has its inbuilt limitations and explorations. The versatile approach of different techniques which is in practice helps in bringing out the hybrid search techniques around it. For any tree representation, the sorted order is expected to achieve the best performance. This paper exhibits the new technique named the biform tree approach for producing the sorted order of elements and to perform efficient searching.

show abstract

Section: A Comparison On Searching Performancementioning

confidence: 99%