java云盘后端服务器+前端electron前后端分离式+简单部署教程

package org.Test; import org.usance.domain.BinarySource; import java.util.ArrayList; import java.util.List; /** * @author wuangjing * @create 2020/5/16-15:41 * @Description: */ public class BinaryTreeTemporary { private static BinarySource b = new BinarySource(null, 0, null); private static List<BinarySource> list = new ArrayList<BinarySource>(); public static void main(String[] args) { b = addBinaryNode(b, 1, 2); BinarySource source1 = addBinaryNode(b.getSecondSource(), 11, 12); BinarySource source2 = addBinaryNode(b.getSecondarySource(), 21, 22); addBinaryNode(source1.getSecondSource(), 23, 45); addBinaryNode(source1.getSecondarySource(), 35, 66); addBinaryNode(source2.getSecondSource(), 46, 67); addBinaryNode(source2.getSecondarySource(), 77, 89); sequenceIterationBefore(b); System.out.print("前序遍历结果:"); for (BinarySource source : list) { System.out.println(source.getData()); } System.out.println("------------"); System.out.println("树的深度："+getTreeDepth(b)); } /** * 前序遍历 * * @param binaryS */ public static void sequenceIterationBefore(BinarySource binaryS) { list.add(binaryS); if (binaryS.getSecondSource() != null) { sequenceIterationBefore(binaryS.getSecondSource()); } if (binaryS.getSecondarySource() != null) { sequenceIterationBefore(binaryS.getSecondarySource()); } return; } /** * 中序遍历 * * @param binaryS */ public static void inTheSequenceIteration(BinarySource binaryS) { if (binaryS.getSecondSource() != null) { inTheSequenceIteration(binaryS.getSecondSource()); } list.add(binaryS); if (binaryS.getSecondarySource() != null) { inTheSequenceIteration(binaryS.getSecondarySource()); } return; } /** * 后序遍历 * * @param binaryS */ public static void afterTheSequenceIteration(BinarySource binaryS) { if (binaryS.getSecondSource() != null) { inTheSequenceIteration(binaryS.getSecondSource()); } if (binaryS.getSecondarySource() != null) { inTheSequenceIteration(binaryS.getSecondarySource()); } list.add(binaryS); return; } /** * 深度遍历 * @param binaryS * @return */ public static int getTreeDepth(BinarySource binaryS) { if (binaryS.getSecondSource() == null && binaryS.getSecondarySource() == null) { return 1; } int left = 0, right = 0; if (binaryS.getSecondSource() != null) { left = getTreeDepth(binaryS.getSecondSource()); } if (binaryS.getSecondarySource() != null) { right = getTreeDepth(binaryS.getSecondarySource()); } return left > right ? left + 1 : right + 1; } /** * 链式添加结点 * * @param binarySource * @param LeftValue * @param RightValue * @return */ public static BinarySource addBinaryNode(BinarySource binarySource, Integer LeftValue, Integer RightValue) { if (LeftValue != null) { binarySource.setSecondSource(new BinarySource(null, LeftValue, null)); } if (RightValue != null) { binarySource.setSecondarySource(new BinarySource(null, RightValue, null)); } return binarySource; } }