/* 采用后序遍历的方法来实现 */ private TreeNode prev = null; public void flatten(TreeNode root){ if(root == null){ return; } flatten(root.right); flatten(root.left); root.right = prev; root.left = null; prev = root; }
把一棵二叉树压平
猜你喜欢
转载自blog.csdn.net/qq_25499519/article/details/80468140
今日推荐
周排行