Skip to search formSkip to main contentSkip to account menu

Self-balancing binary search tree

Known as: Balanced binary tree, Height-balanced binary search tree, Rebalance 
In computer science, a self-balancing (or height-balanced) binary search tree is any node-based binary search tree that automatically keeps its… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Convergecast, the process of data collection from set of sensor nodes and forwards to the sink node over a tree based topology is… 
2010
2010
The global financial and economic crisis has affected East Asia mainly through the trade channel. The region remains heavily… 
2008
2008
In this paper we propose a self-balanced binary search tree data structure for shape matching. This was originally developed as a… 
Review
2008
Review
2008
Older adults often have more difficulty listening in challenging environments than their younger adult counterparts. On the one… 
Highly Cited
2007
Highly Cited
2007
SUMMARY The purpose of this paper is to present a robust tracking control algorithm for underactuated biped robots capable of… 
Highly Cited
2007
Highly Cited
2007
As NAND flash memory becomes increasingly popular as data storage for embedded systems, many file systems and database management… 
2005
2005
  • Hyunsook KimK. Han
  • 2005
  • Corpus ID: 18681795
A wireless sensor network consisting of a large number of nodes with limited battery power should minimize energy consumption at… 
2000
2000
This article presents an IN architecture that is based on distributed object and mobile agent technologies. It deviates from… 
1995
1995
We examine the problem of mapping a Boolean network using gates from a finite size cell library. The objective is to minimize the…