K-ary tree to binary tree conversion through complete height balanced technique
Number of patents in Portfolio can not be more than 2000
United States of America Patent
Stats
-
Jul 25, 2017
Grant Date -
Jun 18, 2015
app pub date -
Oct 19, 2012
filing date -
Jun 15, 2012
priority date (Note) -
In Force
status (Latency Note)
Importance
Abstract
Technologies are generally provided for converting a k-ary tree to an equivalent height balanced binary tree. A k-ary tree root may be first set as the binary tree root. Nodes may then be inserted in the binary tree based on nodes of the k-ary tree. First two children of each k-ary tree node may be inserted as left and right children in the binary tree. If there are additional children, those may be inserted into a child queue. If there are less than two children in the k-ary tree, children from the child queue may be used to fill the left and right child nodes in the equivalent binary tree repeating the process level-wise until all nodes in the k-ary tree are processed.
First Claim
Family
International Classification(s)
Cited Art Landscape
Patent Citation Ranking
Recipient Email Address
Recipient Email Address
Comment
Recipient Email Address
Add to Portfolio(s)
To add this patent to one, or more, of your portfolios, simply click the add button.
This Patent is in these Portfolios:
Add to additional portfolios:
Last Refreshed On:
Changes done successfully