Binary Search Tree
Binary Search Tree
root.left<root>root.right
The height of the Binary Search Tree equals the number of links from the root node to the deepest node.
binary search tree take time proportional to the height of the tree
For a complete binary tree with node n, such operations runs in (lg n) worst-case time
the tree is a linear chain of n nodes, however, the same operations takes (n) worst-case time.
root.left<root>root.right
The height of the Binary Search Tree equals the number of links from the root node to the deepest node.
binary search tree take time proportional to the height of the tree
For a complete binary tree with node n, such operations runs in (lg n) worst-case time
the tree is a linear chain of n nodes, however, the same operations takes (n) worst-case time.
Subscribe to:
Post Comments
(
Atom
)
No comments :
Post a Comment