public class TreeTest { public static void main(String[] args){ TreeTest test = new TreeTest(); TreeNode root = test.createTree(); test.outputTreeValue(root); System.out.println(); test.swapLeftRightNode(root); test.outputTreeValue(root); } public void outputTreeValue(TreeNode root){ if(root != null){ System.out.print(root.getValue() + " "); if(root.getLeftNode() != null){ outputTreeValue(root.getLeftNode()); } if(root.getRightNode() !&
二叉树遍历,交换节点
最新推荐文章于 2023-05-25 21:30:28 发布