⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 bt.html

📁 平衡二叉树 生成
💻 HTML
字号:
<html>
<head>
<title>AVL tree applet</title>
</head>
<body bgcolor="#FFFFFF">
        <font size="2" face="Arial">The
        inset below illustrates the behavior of an AVL-balanced
        tree. You can insert, delete and locate nodes in the tree
        using control buttons. All operations are animated. If an
        action is initiated when another animation is still
        running, the current task is expedited allowing the new
        animated process to start. The data can be entered
        manually or randomly generated. By pressing
        &lt;Insert&gt; button only, you can quickly build a large
        tree. If the &lt;AVL&gt; option is not checked, the
        algorithm will no longer balance the tree after
        insertions and deletions. If this option is enabled for
        an existing structure, the whole tree will be
        rebalanced.</font><p>

<center>
        <applet code="BTApplet.class" align="baseline" width="600"
        height="300"><!-- <param name="nodes"
        value="50,30,70,20,40,60,80,35,65,75,85,90"> -->
        <param name="nodes"
        value=" ">

</center>
        <font size="2" face="Arial"> </font></p>
        <p><font size="2" face="Arial">
        Feel free to play with the
        tree and grab individual nodes with your mouse. The
        applet will point out the previous and next nodes
        depending on the selected traversal method. Changing
        &lt;Shape&gt; will be useful when the tree grows larger.
        You can also &lt;Shake&gt; the tree to keep the bugs out.</font>
        </p>
</body>
</html>

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -