https://github.com/nishusharma1608/average-path-length-to-a-random-node-in-a-bst

Empirical studies to compute the average and standard deviation of the average length of a path to random node (internal path length divided bye tree size,plus 1) in a BST built by insertion of N random keys into an initially empty tree,for N from 100 to 10,000.1000 trials for each tree size to increase precision.Plotted the result in a Tufte plot,fit with a curve plotting the function 1.39 logN - 1.85.
https://github.com/nishusharma1608/average-path-length-to-a-random-node-in-a-bst

Last synced: 10 days ago
JSON representation

Empirical studies to compute the average and standard deviation of the average length of a path to random node (internal path length divided bye tree size,plus 1) in a BST built by insertion of N random keys into an initially empty tree,for N from 100 to 10,000.1000 trials for each tree size to increase precision.Plotted the result in a Tufte plot,fit with a curve plotting the function 1.39 logN - 1.85.

• Host: GitHub
• URL: https://github.com/nishusharma1608/average-path-length-to-a-random-node-in-a-bst
• Owner: nishusharma1608
• Created: 2016-12-05T09:01:00.000Z (almost 8 years ago)
• Default Branch: master
• Last Pushed: 2016-12-05T09:06:10.000Z (almost 8 years ago)
• Last Synced: 2024-03-20T09:57:56.042Z (8 months ago)
• Language: Java
• Size: 3.16 MB
• Stars: 0
• Watchers: 2
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# Average-Path-Length-to-a-Random-Node-in-a-BST

Empirical studies to compute the average and standard deviation of the average length of a path to random node (internal path length divided bye tree size,plus 1) in  a BST built by insertion of N random keys into an initially empty tree,for N from 100 to 10,000.1000 trials for each tree size to increase precision.Plotted the result in a Tufte plot,fit with a curve plotting the function 1.39 logN - 1.85.