Thursday, 29 August 2013

Height of binary search tree in constant time

Height of binary search tree in constant time

References

Reference NO 1

http://stackoverflow.com/questions/15193306/height-of-binary-search-tree-in-constant-time

Reference NO 2

http://pages.cs.wisc.edu/~vernon/cs367/notes/9.BST.html

Reference NO 3

http://courses.csail.mit.edu/6.006/spring11/rec/rec03.pdf

Reference NO 4

http://cs.nyu.edu/courses/fall02/V22.0310-002/lectures/lecture-15.html

Reference NO 5

http://algs4.cs.princeton.edu/32bst/

Reference NO 6

http://en.wikipedia.org/wiki/Self-balancing_binary_search_tree

Reference NO 7

http://pages.cs.wisc.edu/~vernon/cs367/notes/9.BST.html

Reference NO 8

http://www.cs.uiuc.edu/~jeffe/teaching/algorithms/notes/15-scapegoat+splay.pdf

No comments:

Post a Comment