为什么二叉树的高度为0(log(n)) [英] Why the height of a binary tree is 0(log(n))

问题描述

嘿，我很难理解为什么二叉树的高度是log(n).
我已经在许多排序算法中看到了它，但我仍然无法从逻辑上理解为什么它的log(n).
可以请别人解释一下.

Hey I am having difficulty to understand why the height of a binary tree is log(n).
I have seen it in many sorting algorithms and still i cannot understand logicly why its log(n).
Can please someone explain it.

推荐答案

阅读此内容:
http://www.cs.cmu.edu/~adamchik/15- 121/lectures/Trees/trees.html [

Hi,

Read this:
http://www.cs.cmu.edu/~adamchik/15-121/lectures/Trees/trees.html[^]

这篇关于为什么二叉树的高度为0(log(n))的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！