java计算二叉树的节点最小值_二叉树算法大全(java版)

data != null) {

System.out.print(elements[front].data + " ");

if (elements[front].leftTree != null)

elements[rear++] = elements[front].leftTree;

if (elements[front].rightTree != null)

elements[rear++] = elements[front].rightTree;

front++;

}

} catch (Exception e) {

break;

}

}

}

// 求二叉树的高度

public static int height(BiTree tree) {

if (tree == null)

return 0;

else {

int leftTreeHeight = height(tree.leftTree);

int rightTreeHeight = height(tree.rightTree);

return leftTreeHeight &gt rightTreeHeight ? leftTreeHeight + 1

: rightTreeHeight + 1;

}

}

// 求data所对应结点的层数，如果对象不在树中,结果返回-1;否则结果返回该对象在树中所处的层次,规定根节点为第一层

public int level(Object data) {

int leftLevel, rightLevel;

if (this == null)

return -1;

if (data == this.data)

return 1;

leftLevel = leftTree == null ? -1 : leftTree.level(data);

rightLevel = rightTree == null ? -1 : rightTree.level(data);

if (leftLevel &lt 0 && rightLevel &lt 0)

return -1;

return leftLevel &gt rightLevel ? leftLevel + 1 : rightLevel + 1;

}

// 求二叉树的结点总数

public static int nodes(BiTree tree) {

if (tree == null)

return 0;

else {

int left = nodes(tree.leftTree);

int right = nodes(tree.rightTree);

return left + right + 1;

}

}

// 求二叉树叶子节点的总数

public static int leaf(BiTree tree) {

if (tree == null)

return 0;

else {

int left = leaf(tree.leftTree);

int right = leaf(tree.rightTree);

if (tree.leftTree == null && tree.rightTree == null)

return left + right + 1;

else

return left + right;

}

}

// 求二叉树父节点个数

public static int fatherNodes(BiTree tree) {

if (tree == null || (tree.leftTree == null && tree.rightTree == null))

return 0;

else {

int left = fatherNodes(tree.leftTree);

int right = fatherNodes(tree.rightTree);

return left + right + 1;

}

}

// 求只有一个孩子结点的父节点个数

public static int oneChildFather(BiTree tree) {

int left, right;

if (tree == null || (tree.rightTree == null && tree.leftTree == null))

return 0;

else {

left = oneChildFather(tree.leftTree);

right = oneChildFather(tree.rightTree);

if ((tree.leftTree != null && tree.rightTree == null)

|| (tree.leftTree == null && tree.rightTree != null))

return left + right + 1;

else

return left + right;/* 加1是因为要算上根节点 */

}

}

// 求二叉树只拥有左孩子的父节点总数

public static int leftChildFather(BiTree tree) {

if (tree == null)

return 0;

else {

int left = leftChildFather(tree.leftTree);

int right = leftChildFather(tree.rightTree);

if ((tree.leftTree != null && tree.rightTree == null))

return left + right + 1;

else

return left + right;

}

}

// 求二叉树