Description: All empty tree is a binary search tree.
A binary tree is not empty, the root R is a binary search tree if:
• In case of left subtree, the root R must be greater than the maximum value
stored in the left subtree, and that the left subtree is a binary tree
search.
• If you have the right subtree, the root R must be less than the minimum
stored in the right subtree, and the right subtree is a binary tree
search.
To Search:
File list (Check if you may need any files):
ArbolABB
........\ArbolABB.jcd
........\ArbolABB.jcp
........\ArbolABB.jcu
........\ArbolABB.jcw
........\classes
........\.......\ArbolABB.class
........\.......\ArbolPrincipal.class
........\.......\Cola.class
........\.......\Nodo.class
........\.......\NodoBinario.class
........\.......\Pila.class
........\src
........\...\ArbolABB.java
........\...\ArbolPrincipal.java
........\...\Cola.java
........\...\Nodo.java
........\...\NodoBinario.java
........\...\Pila.java
........\src_arbolabb.txt
Download